Journal: Oper. Res. Lett.

Volume 50, Issue 6

627 -- 631Vyacheslav Kungurtsev. Distributed stochastic nonsmooth nonconvex optimization
632 -- 638Christoph Buchheim, Emiliano Traversi. Convex optimization under combinatorial sparsity constraints
639 -- 645Adriana Navarro-Ramos. A new approach to agglomeration problems
646 -- 649Asaf Levin. Comparing the costs of Any Fit algorithms for bin packing
650 -- 654André Casajus, Michael Kramm. Asymptotic stability in replicator dynamics derived from TU games
655 -- 659Christopher Thomas Ryan, Robert L. Smith 0002. A greedy algorithm for finding maximum spanning trees in infinite graphs
660 -- 666Dashi I. Singham, Mark D. Rodgers. A shortage probability metric for battery depletion risk
667 -- 673Ojas Parekh, R. Ravi 0001, Michael Zlatin. On small-depth tree augmentations
674 -- 678Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor. Revisiting surrogate relaxation for the multidimensional knapsack problem
679 -- 684Yi Feng, Sami Abdus, Gladys Tuo, Shaoxiang Chen. Raw materials and production control with random supply and demand, an outside market and production capacity
685 -- 692Zhe Yang, Li Li. Oligopolistic markets with leadership, cooperative followers and a multivalued inverse demand function
693 -- 698Jennifer Iglesias, R. Ravi 0001. Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
699 -- 706Ellen Cardinaels, Sem C. Borst, Johan S. H. van Leeuwaarden. Power-of-two sampling in redundancy systems: The impact of assignment constraints
707 -- 711Bart van Rossum. A fast exact pricing algorithm for the railway crew scheduling problem
712 -- 718Hayriye Ayhan. Optimal admission control in queues with abandonments
719 -- 725Ilyass Dahmouni. A note on yardstick regulation of fishery monopolies
726 -- 731Pingping Zeng, Chao Shi. Computable error bounds of multidimensional Euler inversion and their financial applications
732 -- 737Sven O. Krumke, Le Huy Minh. 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
738 -- 744Torbjörn Larsson, Nils-Hassan Quttineh. Column generation extensions of set covering greedy heuristics
745 -- 752Ke Sun, Yunan Liu, Xiang Li. Make waiting not to seem like waiting: Capacity management of waiting-area entertainment
753 -- 755Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel. Testing idealness in the filter oracle model

Volume 50, Issue 5

423 -- 429Peter L. Jackson. Support vector machines as Bayes' classifiers
430 -- 433Santanu S. Dey, Prachi Shah. Lower bound on size of branch-and-bound trees for solving lot-sizing problem
434 -- 440Pengzhan Chen, Yingda Song. Irreversible investment with random delay and partial prepayment
441 -- 445Juan Carlos Martínez Mori, Samitha Samaranayake. Permutatorial optimization via the permutahedron
446 -- 451Stéphane Alarie, Charles Audet, Paulin Jacquot, Sébastien Le Digabel. Hierarchically constrained blackbox optimization
452 -- 457Maël Forcier, Vincent Leclère. Generalized adaptive partition-based method for two-stage stochastic linear programs: Geometric oracle and analysis
458 -- 462David Huckleberry Gutman, Nam Ho-Nguyen. Cyclic coordinate descent in the Hölder smooth setting
463 -- 469Martin Böhm 0001, Nicole Megow, Jens Schlöter. Throughput scheduling with equal additive laxity
470 -- 474Libing Wang, Han Xiao 0003, Donglei Du, Dachuan Xu. On the population monotonicity of independent set games
475 -- 0Nili 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]
476 -- 483Stéphane R. A. Barde, Young Myoung Ko, Hayong Shin. General EM algorithm for fitting non-monotone hazard functions from truncated and censored observations
484 -- 487André Casajus, Michael Kramm. Solutions for non-negatively weighted TU games derived from extension operators
488 -- 494Yajing Chen, Yanyue Huang, Zhenhua Jiao, Yunfan Zhao. A comparison study on responsiveness of three mechanisms to affirmative action in school choice
495 -- 502Lusheng Shao. A capacity reservation game for suppliers with multiple blocks of capacity
503 -- 508Fernando H. C. Dias, David Rey. Robust aircraft conflict resolution under trajectory prediction uncertainty
509 -- 512Linjia Dong, Zhaojun Yang. Hedging-based utility risk measure customized for individual investors
513 -- 516Tomer Shushi. The optimal solution of ESG portfolio selection models that are based on the average ESG score
517 -- 523Amir Beck, Nadav Hallak. The regularized feasible directions method for nonconvex optimization
524 -- 528Dieter Fiems, Joris Walraevens. Recursive calculation of moments in priority queues
529 -- 535Christoph Jacobi, Kai Furmans. Point and interval estimation of decomposition error in discrete-time open tandem queues
536 -- 540Aditi Laddha, Mohit Singh, Santosh S. Vempala. Socially fair network design via iterative rounding
541 -- 547E. 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
548 -- 554Marcelo Brutti Righi, Marlon Ruoso Moresco. Star-Shaped deviations
555 -- 560Nimrod Dvir, Refael Hassin, Moshe Haviv. On equilibrium threshold strategies when choosing between observable and unobservable queues
561 -- 567Alexander Shapiro. Distributionally robust modeling of optimal control
568 -- 573Koorosh Shomalzadeh, Jacquelien M. A. Scherpen, M. Kanat Camlibel. Bilevel aggregator-prosumers' optimization problem in real-time: A convex optimization approach
574 -- 580Bara Kim, Jeongsim Kim, Chia-Li Wang. Optimal stochastic control of the intensity of point processes
581 -- 587Matthew Bold, Marc Goerigk. A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem
588 -- 595René Caldentey, Avi Giloni, Clifford Hurvich. Performance bound for myopic order-up-to inventory policies under stationary demand processes
596 -- 601Xu Tian, Gongbing Bi, Yang Xu. Does an increase in the number of solvers benefit the seeker in heterogeneous contests?
602 -- 609Amit Kumar Debnath, Debdas Ghosh. Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems
610 -- 617Babak Abbasi, Joanna Bruzda, Nagesh Gavirneni. Optimal operational service levels in vendor managed inventory contracts - an exact approach
618 -- 622Qingyun Wu. Dynamic matching with teams
623 -- 625Marilena Leichter, Benjamin Moseley, Kirk Pruhs. On the impossibility of decomposing binary matroids

Volume 50, Issue 4

377 -- 383Hongyu Chen, Zizhuo Wang 0001. Optimal control for parallel queues with a single batch server
384 -- 390Shichuan Deng. Constant approximation for fault-tolerant median problems via iterative rounding
391 -- 398Serguei Kaniovski, Alexander Zaigraev. Asymptotic probability of majority inversion under a general binomial voting model
399 -- 406Asrar Ahmed, Milind G. Sohoni, Chaithanya Bandi. Parameterized approximations for the two-sided assortment optimization
407 -- 414Hung Quoc Nguyen, Tuan Phung-Duc. A two-population game in observable double-ended queuing systems
415 -- 421Nabil Kahalé. On the effective dimension and multilevel Monte Carlo

Volume 50, Issue 3

0 -- 0Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma, Marc Uetz. In memoriam Gerhard Woeginger
235 -- 240Yiruo Lu, Tong Zhang, Yongpei Guan. An extended formulation for two-stage stochastic unit commitment with reserves
241 -- 245Christian Tilk. ng-path relaxation for bike balancing problems
246 -- 253Jiawen Xu, Deqing Luo, Jingzhou Yan, Xiaoping Wu. Robust risk-taking under a sustainable constraint
254 -- 259Erhun Özkan. cμ-rule in queueing networks
260 -- 267Wan-Ni Lai. Detecting stock market regimes from option prices
268 -- 273Kerim Keskin, H. Çagri Saglam. Fatigue accumulation in dynamic contests
274 -- 280Marta Cavaleiro, Farid Alizadeh. k-enclosing ball problem
281 -- 286Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern. Two dimensional maximum weight matching using Manhattan topology
287 -- 294Benjamin Legros. The transient blended queue
295 -- 302Ping Cao, Dacheng Yao. Optimal pricing and inventory control strategy for a continuous-review system with product return
303 -- 309Yun Liu. On the equivalence of two competing affirmative actions in school choice
310 -- 314Ran Hu, Jingru Zhang. k-centers of uncertain points on a real line
315 -- 321Deniz Akturk. Managing inventory in a network: Performance bounds for simple policies
322 -- 328Sebastian Berndt, Franziska Eberle, Nicole Megow. Online load balancing with general reassignment cost
329 -- 334Hui Zhang. Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems
335 -- 342Chunmei Jiang, Tongqing Li, Jie Yu. Approximating Nash equilibrium for production control with sticky price
343 -- 346Hung Quoc Nguyen, Tuan Phung-Duc. To wait or not to wait: Strategic behaviors in an observable batch-service queueing system
347 -- 355Shuang Hao, Dali Zhang, Ming Dong. Iteratively sampling scheme for stochastic optimization with variable number sample path
356 -- 361Marianna De Santis, Gabriele Eichfelder, Daniele Patria. ε-constraint method for biobjective nonlinear integer programming
362 -- 369Yueyang Zhong, Amy R. Ward, Amber L. Puha. GI queue
370 -- 375Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. A parameterized view to the robust recoverable base problem of matroids under structural uncertainty

Volume 50, Issue 2

99 -- 106Andrés Cristi, Marc Schröder 0002. Negative prices in network pricing games
107 -- 114Victor K. Domansky, Victoria L. Kreps. The value function of a transportation problem
115 -- 121Euiwoong Lee, Viswanath Nagarajan, Lily Wang. On some variants of Euclidean k-supplier
122 -- 128Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos. Generalised 2-circulant inequalities for the max-cut problem
129 -- 132Takuro Fukunaga, R. Ravi 0001, Oleksandr Rudenko, Ziye Tang. Approximation algorithm for the 2-stage stochastic matroid base problem
133 -- 136Wenzhong Li, Genjiu Xu, René van den Brink. A note on sign symmetry for a subclass of efficient, symmetric, and linear values
137 -- 144Adriana Piazza, Bernardo K. Pagnoncelli, Lewis Ntaimo. What is the optimal cutoff surface for ore bodies with more than one mineral?
145 -- 149Manuel Aprile. Extended formulations for matroid polytopes through randomized protocols
150 -- 154Xiangyang Huang, Shudong Zhang, Lijuan Zhou, LiGuo Huang. A hybrid algorithm for the minimum bounding sphere problem
155 -- 159Katrin Heßler, Stefan Irnich. A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing
160 -- 167M. Kayid, M. A. Al-Shehri. Preservation of transform orders under a semiparametric model and its mixture
168 -- 175Kartik Kulkarni, Manish Bansal. Discrete multi-module capacitated lot-sizing problems with multiple items
176 -- 183Chao Shang, Chao Wang, Keyou You, Dexian Huang. Distributionally robust chance constraint with unimodality-skewness information and conic reformulation
184 -- 189Tesi Xiao, Krishnakumar Balasubramanian, Saeed Ghadimi. Improved complexities for stochastic conditional gradient methods under interpolation-like conditions
190 -- 194Erfang Shan, Wenrong Lyu, Jilei Shi, Shanshan Nie. Consistency and the graph Banzhaf value for communication graph games
195 -- 198Shaoning Han, Andrés Gómez 0001, Alper Atamtürk. The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
199 -- 204Zhenyu Cui, Yanchu Liu, Ruodu Wang. Variance comparison between infinitesimal perturbation analysis and likelihood ratio estimators to stochastic gradient
205 -- 212Zahed Shahmoradi, Taewoo Lee. Optimality-based clustering: An inverse optimization approach
213 -- 217Sandeep Silwal. A concentration inequality for the facility location problem
218 -- 223V. Varagapriya, Vikas Vikram Singh, Abdel Lisser. Constrained Markov decision processes with uncertain costs
224 -- 228Yotaro Takazawa. Approximation algorithm for the stochastic prize-collecting set multicover problem
229 -- 234Luca Accorsi, Andrea Lodi 0001, Daniele Vigo. Guidelines for the computational testing of machine learning approaches to vehicle routing problems

Volume 50, Issue 1

1 -- 7Amir Beck, Raz Sharon. New results on multi-dimensional linear discriminant analysis
8 -- 15ShaoJie Tang, Jing Yuan 0002, Chenhao Wang, Yao Wang, Luoying Chen. Assortment optimization with repeated exposures and product-dependent patience cost
16 -- 19Matthias Brugger, Andreas S. Schulz. On the complexity of recognizing integrality and total dual integrality of the {0, 1/2}-closure
20 -- 27Benjamin Moseley, Shai Vardi. The efficiency-fairness balance of Round Robin scheduling
28 -- 31Zhongzheng Tang, Chenhao Wang 0001, Hau Chan. k-submodular function under a knapsack constraint
32 -- 39Yan Su, Junping Li. On the optimality of a maintenance queueing system
40 -- 44Minh N. Bùi. A decomposition method for solving multicommodity network equilibria
45 -- 49Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu 0001. Online minimum matching with uniform metric and random arrivals
50 -- 56Quentin Fabry, Alessandro Agnetis, Lotte Berghman, Cyril Briand. Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations
57 -- 63Horst Zisgen. An approximation of general multi-server queues with bulk arrivals and batch service
64 -- 71George Gilliam, Nelson A. Uhan. Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
72 -- 75Bo Li 0037, Chenhao Wang 0001, Ruilong Zhang. A note on the online interval scheduling secretary problem
76 -- 83Matthias Claus, Kai Spürkel. Improving constants of strong convexity in linear stochastic programming
84 -- 90Maxwell Allman, Venus Lo, S. Thomas McCormick. Complexity of Source-Sink Monotone 2-parameter min cut
91 -- 98Vo Minh Tam. Dynamical systems for solving variational inclusion and fixed point problems on Hadamard manifolds