Journal: Oper. Res. Lett.

Volume 49, Issue 4

443 -- 446Lei Fang, Sai Zhao. Strategic delegation in a differentiated duopoly with asymmetric costs
447 -- 451Martina Cerulli, Leo Liberti. Polynomial programming prevents aircraft (and other) conflicts
452 -- 458Cheik Traoré, Edouard Pauwels. Sequential convergence of AdaGrad algorithm for smooth convex optimization
459 -- 464Josu Doncel, Vincenzo Mancuso. Optimal performance of parallel-server systems with job size prediction errors
465 -- 472Najakorn Khajonchotpanya, Yilin Xue, Napat Rujeerapaiboon. A revised approach for risk-averse multi-armed bandits under CVaR criterion
473 -- 476Yongling Gao, Mingming Leng. Incentivizing the adoption of electric vehicles under subsidy schemes: A duopoly analysis
477 -- 484Zhenyu Cui, Chihoon Lee, Lingjiong Zhu, Yunfan Zhu. On the optimal design of the randomized unbiased Monte Carlo estimators
485 -- 491Zhongbin Wang, Jinting Wang. The effect of information on queue-scalping service systems
492 -- 495Daniel Li Li, Erfang Shan. Egalitarian allocation and players of certain type
496 -- 500Jianru Zhang, Yi Li 0035, Ju'e Guo, Kin Keung Lai. Salesforce contracting under model uncertainty
501 -- 506Orcun Karaca, Stefanos Delikaraoglou, Maryam Kamgarpour. A market-based approach for enabling inter-area reserve exchange
507 -- 514Ariel Kulik, Roy Schwartz 0002, Hadas Shachnai. A refined analysis of submodular Greedy
515 -- 521Xianghui Zhong. On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP
522 -- 529Seth Brown, Wenxin Zhang, Temitayo Ajayi, Andrew J. Schaefer. A Gilmore-Gomory construction of integer programming value functions
530 -- 534Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor. On the complexity of surrogate and group relaxation for integer linear programs
535 -- 542Qing Li, Peiwen Yu. The secretary problem with multiple job vacancies and batch candidate arrivals
543 -- 547Arezu Zare, Ali Ashrafi, Yong Xia. Quadratic double-ratio minimax optimization
548 -- 552Xiao-Bing Li, Suliman Al-Homidan, Qamrul Hasan Ansari, Jen-Chih Yao. A sufficient condition for asymptotically well behaved property of convex polynomials
553 -- 558Alessio Trivella, Selvaprabu Nadarajah. Socially responsible merchant operations: Comparison of shutdown-averse CVaR and anticipated regret policies
559 -- 564Dorit S. Hochbaum, Asaf Levin, Xu Rao. Complexity, algorithms and applications of the integer network flow with fractional supplies problem
565 -- 571Cyrille W. Combettes, Sebastian Pokutta. Complexity of linear minimization and projection on some sets
572 -- 577Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong. On the complexity of fair house allocation
578 -- 585Bo Wei, Dacheng Yao. Ergodic inventory control with diffusion demand and general ordering costs
586 -- 589Adam N. Letchford, Paolo Ventura. Strengthened clique-family inequalities for the stable set polytope
590 -- 596Vacharapat Mettanant, Jittat Fakcharoenphol. Fair resource allocation for demands with sharp lower tail inequalities
597 -- 601Muhammad Maaz. Saturating stable matchings
602 -- 609Meichun Lin, Woonghee Tim Huh, Guohua Wan. Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
610 -- 615Laura Galli, Adam N. Letchford. A separation algorithm for the simple plant location problem
616 -- 622Daniela Hurtado-Lange, Siva Theja Maguluri. d choices in inhomogeneous load balancing systems
623 -- 624Matthias Walter. The Graphical Traveling Salesperson Problem has no integer programming formulation in the original space