default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 50
Volume 50, Number 1, January 2022
- Amir Beck
, Raz Sharon:
New results on multi-dimensional linear discriminant analysis. 1-7 - Shaojie Tang, Jing Yuan, Chenhao Wang, Yao Wang, Luoying Chen:
Assortment optimization with repeated exposures and product-dependent patience cost. 8-15 - Matthias Brugger, Andreas S. Schulz:
On the complexity of recognizing integrality and total dual integrality of the {0, 1/2}-closure. 16-19 - Benjamin Moseley, Shai Vardi:
The efficiency-fairness balance of Round Robin scheduling. 20-27 - Zhongzheng Tang, Chenhao Wang, Hau Chan:
On maximizing a monotone k-submodular function under a knapsack constraint. 28-31 - Yan Su, Junping Li:
On the optimality of a maintenance queueing system. 32-39 - Minh N. Bùi:
A decomposition method for solving multicommodity network equilibria. 40-44 - Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu:
Online minimum matching with uniform metric and random arrivals. 45-49 - Quentin Fabry, Alessandro Agnetis, Lotte Berghman, Cyril Briand:
Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations. 50-56 - Horst Zisgen:
An approximation of general multi-server queues with bulk arrivals and batch service. 57-63 - George Gilliam, Nelson A. Uhan:
Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner. 64-71 - Bo Li, Chenhao Wang, Ruilong Zhang:
A note on the online interval scheduling secretary problem. 72-75 - Matthias Claus, Kai Spürkel:
Improving constants of strong convexity in linear stochastic programming. 76-83 - Maxwell Allman, Venus Lo, S. Thomas McCormick:
Complexity of Source-Sink Monotone 2-parameter min cut. 84-90 - Vo Minh Tam:
Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds. 91-98
Volume 50, Number 2, March 2022
- Andrés Cristi, Marc Schröder:
Negative prices in network pricing games. 99-106 - Victor K. Domansky, Victoria L. Kreps:
The value function of a transportation problem. 107-114 - Euiwoong Lee, Viswanath Nagarajan, Lily Wang:
On some variants of Euclidean k-supplier. 115-121 - Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
Generalised 2-circulant inequalities for the max-cut problem. 122-128 - Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang:
Approximation algorithm for the 2-stage stochastic matroid base problem. 129-132 - Wenzhong Li, Genjiu Xu, René van den Brink:
A note on sign symmetry for a subclass of efficient, symmetric, and linear values. 133-136 - Adriana Piazza, Bernardo K. Pagnoncelli, Lewis Ntaimo:
What is the optimal cutoff surface for ore bodies with more than one mineral? 137-144 - Manuel Aprile:
Extended formulations for matroid polytopes through randomized protocols. 145-149 - Xiangyang Huang, Shudong Zhang, Lijuan Zhou, LiGuo Huang:
A hybrid algorithm for the minimum bounding sphere problem. 150-154 - Katrin Heßler, Stefan Irnich:
A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing. 155-159 - M. Kayid, Mashael A. Al-Shehri:
Preservation of transform orders under a semiparametric model and its mixture. 160-167 - Kartik Kulkarni, Manish Bansal:
Discrete multi-module capacitated lot-sizing problems with multiple items. 168-175 - Chao Shang, Chao Wang, Keyou You, Dexian Huang:
Distributionally robust chance constraint with unimodality-skewness information and conic reformulation. 176-183 - Tesi Xiao, Krishnakumar Balasubramanian, Saeed Ghadimi:
Improved complexities for stochastic conditional gradient methods under interpolation-like conditions. 184-189 - Erfang Shan, Wenrong Lyu, Jilei Shi, Shanshan Nie:
Consistency and the graph Banzhaf value for communication graph games. 190-194 - Shaoning Han, Andrés Gómez, Alper Atamtürk:
The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables. 195-198 - Zhenyu Cui, Yanchu Liu, Ruodu Wang:
Variance comparison between infinitesimal perturbation analysis and likelihood ratio estimators to stochastic gradient. 199-204 - Zahed Shahmoradi, Taewoo Lee:
Optimality-based clustering: An inverse optimization approach. 205-212 - Sandeep Silwal:
A concentration inequality for the facility location problem. 213-217 - V. Varagapriya, Vikas Vikram Singh, Abdel Lisser:
Constrained Markov decision processes with uncertain costs. 218-223 - Yotaro Takazawa:
Approximation algorithm for the stochastic prize-collecting set multicover problem. 224-228 - Luca Accorsi, Andrea Lodi, Daniele Vigo:
Guidelines for the computational testing of machine learning approaches to vehicle routing problems. 229-234
Volume 50, Number 3, May 2022
- Yiruo Lu, Tong Zhang, Yongpei Guan:
An extended formulation for two-stage stochastic unit commitment with reserves. 235-240 - Christian Tilk:
Adapting the ng-path relaxation for bike balancing problems. 241-245 - Jiawen Xu, Deqing Luo, Jingzhou Yan, Xiaoping Wu:
Robust risk-taking under a sustainable constraint. 246-253 - Erhun Özkan:
On the asymptotic optimality of the cμ-rule in queueing networks. 254-259 - Wan-Ni Lai:
Detecting stock market regimes from option prices. 260-267 - Kerim Keskin, H. Çagri Saglam:
Fatigue accumulation in dynamic contests. 268-273 - Marta Cavaleiro, Farid Alizadeh:
A branch-and-bound method for the minimum k-enclosing ball problem. 274-280 - Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern:
Two dimensional maximum weight matching using Manhattan topology. 281-286 - Benjamin Legros:
The transient blended queue. 287-294 - Ping Cao, Dacheng Yao:
Optimal pricing and inventory control strategy for a continuous-review system with product return. 295-302 - Yun Liu:
On the equivalence of two competing affirmative actions in school choice. 303-309 - Ran Hu, Jingru Zhang:
Computing k-centers of uncertain points on a real line. 310-314 - Deniz Akturk:
Managing inventory in a network: Performance bounds for simple policies. 315-321 - Sebastian Berndt, Franziska Eberle, Nicole Megow:
Online load balancing with general reassignment cost. 322-328 - Hui Zhang:
Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems. 329-334 - Chunmei Jiang, Tongqing Li, Jie Yu:
Approximating Nash equilibrium for production control with sticky price. 335-342 - Hung Quoc Nguyen, Tuan Phung-Duc:
To wait or not to wait: Strategic behaviors in an observable batch-service queueing system. 343-346 - Shuang Hao, Dali Zhang, Ming Dong:
Iteratively sampling scheme for stochastic optimization with variable number sample path. 347-355 - Marianna De Santis, Gabriele Eichfelder, Daniele Patria:
On the exactness of the ε-constraint method for biobjective nonlinear integer programming. 356-361 - Yueyang Zhong, Amy R. Ward, Amber L. Puha:
Asymptotically optimal idling in the GI/GI/N+GI queue. 362-369 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. 370-375 - Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz:
In memoriam Gerhard Woeginger. iii
Volume 50, Number 4, July 2022
- Hongyu Chen, Zizhuo Wang:
Optimal control for parallel queues with a single batch server. 377-383 - Shichuan Deng:
Constant approximation for fault-tolerant median problems via iterative rounding. 384-390 - Serguei Kaniovski, Alexander Zaigraev:
Asymptotic probability of majority inversion under a general binomial voting model. 391-398 - Asrar Ahmed, Milind G. Sohoni, Chaithanya Bandi:
Parameterized approximations for the two-sided assortment optimization. 399-406 - Hung Quoc Nguyen, Tuan Phung-Duc:
A two-population game in observable double-ended queuing systems. 407-414 - Nabil Kahalé:
On the effective dimension and multilevel Monte Carlo. 415-421
Volume 50, Number 5, September 2022
- Peter L. Jackson:
Support vector machines as Bayes' classifiers. 423-429 - Santanu S. Dey, Prachi Shah:
Lower bound on size of branch-and-bound trees for solving lot-sizing problem. 430-433 - Pengzhan Chen, Yingda Song:
Irreversible investment with random delay and partial prepayment. 434-440 - Juan Carlos Martínez Mori, Samitha Samaranayake:
Permutatorial optimization via the permutahedron. 441-445 - Stéphane Alarie, Charles Audet, Paulin Jacquot, Sébastien Le Digabel:
Hierarchically constrained blackbox optimization. 446-451 - Maël Forcier, Vincent Leclère:
Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis. 452-457 - David Huckleberry Gutman, Nam Ho-Nguyen:
Cyclic coordinate descent in the Hölder smooth setting. 458-462 - Martin Böhm, Nicole Megow, Jens Schlöter:
Throughput scheduling with equal additive laxity. 463-469 - Libing Wang, Han Xiao, Donglei Du, Dachuan Xu:
On the population monotonicity of independent set games. 470-474 - Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern:
Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286]. 475 - Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin:
General EM algorithm for fitting non-monotone hazard functions from truncated and censored observations. 476-483 - André Casajus, Michael Kramm:
Solutions for non-negatively weighted TU games derived from extension operators. 484-487 - Yajing Chen, Yanyue Huang, Zhenhua Jiao, Yunfan Zhao:
A comparison study on responsiveness of three mechanisms to affirmative action in school choice. 488-494 - Lusheng Shao:
A capacity reservation game for suppliers with multiple blocks of capacity. 495-502 - Fernando H. C. Dias, David Rey:
Robust aircraft conflict resolution under trajectory prediction uncertainty. 503-508 - Linjia Dong, Zhaojun Yang:
Hedging-based utility risk measure customized for individual investors. 509-512 - Tomer Shushi:
The optimal solution of ESG portfolio selection models that are based on the average ESG score. 513-516 - Amir Beck, Nadav Hallak:
The regularized feasible directions method for nonconvex optimization. 517-523 - Dieter Fiems, Joris Walraevens:
Recursive calculation of moments in priority queues. 524-528 - Christoph Jacobi, Kai Furmans:
Point and interval estimation of decomposition error in discrete-time open tandem queues. 529-535 - Aditi Laddha, Mohit Singh, Santosh S. Vempala:
Socially fair network design via iterative rounding. 536-540 - E. Ruben van Beesten, Ward Romeijnders:
Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector. 541-547 - Marcelo Brutti Righi, Marlon Ruoso Moresco:
Star-Shaped deviations. 548-554 - Nimrod Dvir, Refael Hassin, Moshe Haviv:
On equilibrium threshold strategies when choosing between observable and unobservable queues. 555-560 - Alexander Shapiro:
Distributionally robust modeling of optimal control. 561-567 - Koorosh Shomalzadeh, Jacquelien M. A. Scherpen, M. Kanat Camlibel:
Bilevel aggregator-prosumers' optimization problem in real-time: A convex optimization approach. 568-573 - Bara Kim, Jeongsim Kim, Chia-Li Wang:
Optimal stochastic control of the intensity of point processes. 574-580 - Matthew Bold, Marc Goerigk:
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. 581-587 - René Caldentey, Avi Giloni, Clifford M. Hurvich:
Performance bound for myopic order-up-to inventory policies under stationary demand processes. 588-595 - Xu Tian, Gongbing Bi, Yang Xu:
Does an increase in the number of solvers benefit the seeker in heterogeneous contests? 596-601 - Amit Kumar Debnath, Debdas Ghosh:
Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems. 602-609 - Babak Abbasi, Joanna Bruzda, Nagesh Gavirneni:
Optimal operational service levels in vendor managed inventory contracts - an exact approach. 610-617 - Qingyun Wu:
Dynamic matching with teams. 618-622 - Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
On the impossibility of decomposing binary matroids. 623-625
Volume 50, Number 6, November 2022
- Vyacheslav Kungurtsev:
Distributed stochastic nonsmooth nonconvex optimization. 627-631 - Christoph Buchheim, Emiliano Traversi:
Convex optimization under combinatorial sparsity constraints. 632-638 - Adriana Navarro-Ramos:
A new approach to agglomeration problems. 639-645 - Asaf Levin:
Comparing the costs of Any Fit algorithms for bin packing. 646-649 - André Casajus, Michael Kramm:
Asymptotic stability in replicator dynamics derived from TU games. 650-654 - Christopher Thomas Ryan, Robert L. Smith:
A greedy algorithm for finding maximum spanning trees in infinite graphs. 655-659 - Dashi I. Singham, Mark D. Rodgers:
A shortage probability metric for battery depletion risk. 660-666 - Ojas Parekh, R. Ravi, Michael Zlatin:
On small-depth tree augmentations. 667-673 - Trivikram Dokka, Adam N. Letchford, Mohammad Hasan Mansoor:
Revisiting surrogate relaxation for the multidimensional knapsack problem. 674-678 - Yi Feng, Sami Abdus, Gladys Tuo, Shaoxiang Chen:
Raw materials and production control with random supply and demand, an outside market and production capacity. 679-684 - Zhe Yang, Li Li:
Oligopolistic markets with leadership, cooperative followers and a multivalued inverse demand function. 685-692 - Jennifer Iglesias, R. Ravi:
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem. 693-698 - Ellen Cardinaels, Sem C. Borst, Johan S. H. van Leeuwaarden:
Power-of-two sampling in redundancy systems: The impact of assignment constraints. 699-706 - Bart T. C. van Rossum:
A fast exact pricing algorithm for the railway crew scheduling problem. 707-711 - Hayriye Ayhan:
Optimal admission control in queues with abandonments. 712-718 - Ilyass Dahmouni:
A note on yardstick regulation of fishery monopolies. 719-725 - Pingping Zeng, Chao Shi:
Computable error bounds of multidimensional Euler inversion and their financial applications. 726-731 - Sven O. Krumke, Le Huy Minh:
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem. 732-737 - Torbjörn Larsson, Nils-Hassan Quttineh:
Column generation extensions of set covering greedy heuristics. 738-744 - Ke Sun, Yunan Liu, Xiang Li:
Make waiting not to seem like waiting: Capacity management of waiting-area entertainment. 745-752 - Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Testing idealness in the filter oracle model. 753-755
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
