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

Volume 49, Issue 3

1 -- 0Amy R. Ward. Editorial
291 -- 299Christos Ordoudis, Viet Anh Nguyen, Daniel Kuhn, Pierre Pinson. Energy and reserve dispatch with distributionally robust joint chance constraints
300 -- 303Yajing Chen, Zhenhua Jiao. On the equivalence of the Boston and top trading cycles school choice mechanisms
304 -- 309Tatsuya Matsuoka, Naoto Ohsaka. Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
310 -- 315Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký. A note on the approximability of deepest-descent circuit steps
316 -- 319Ward Whitt. On the many-server fluid limit for a service system with routing based on delayed information
320 -- 325Refael Hassin, Nikita Leshenko. Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem
326 -- 332Sampath Rajagopalan, Chunyang Tong. Payment models to coordinate healthcare providers: Extension to risk-averse providers
333 -- 337Mircea Balaj. Existence results for quasi-equilibrium problems under a weaker equilibrium condition
338 -- 344Prakash Chakraborty, Harsha Honnappa. A many-server functional strong law for a non-stationary loss model
345 -- 349Bobby S. Nyotta, Fernanda Bravo, M. Keith Chen. Computing the conditional entry-state distribution in Erlang loss systems
350 -- 356Jing Xu 0019. Lose oneself in comparison: An investment and consumption game between two agents
357 -- 364Daniel Bienstock, Yuri Faenza, Xuan Zhang. Pitch, extension complexity, and covering problems
365 -- 371Abbas Kazerouni, Lawrence M. Wein. Best arm identification in generalized linear bandits
372 -- 376Xue Dong He, Zhaoli Jiang. Optimal payoff under the generalized dual theory of choice
377 -- 384Karan N. Chadha, Ankur A. Kulkarni, Jayakrishnan Nair. Efficiency fairness tradeoff in battery sharing
385 -- 392Rodolfo Ayala Lopes, A. R. R. Freitas, Rodrigo César Pedrosa Silva. Local Search with Groups of Step Sizes
393 -- 399Benjamin Legros. Transient analysis of an affine Queue-Hawkes process
400 -- 404Alan M. Frieze, Tomasz Tkocz. Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
405 -- 411Sungjin Im, Benjamin Moseley, Rudy Zhou. The Matroid Cup Game
412 -- 417Matthias Claus. On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function
418 -- 425Christian Ewerhart, Dan Kovenock. A class of N-player Colonel Blotto games with multidimensional private information
426 -- 430Michal Benelli, Refael Hassin. Rational joining behavior in a queueing system with abandonments
431 -- 438Hoa T. Bui, Ryan C. Loxton, Asghar Moeini. A note on the finite convergence of alternating projections
439 -- 441Aner Sela. Reverse contests

Volume 49, Issue 2

1 -- 0Jan Karel Lenstra. Amy Ward new Editor-in-Chief
157 -- 163Matthew K. Tam. Gearhart-Koshy acceleration for affine subspaces
164 -- 170Jie Zhang, Shuang Lin, Yi Zhang. Asymptotic analysis for a stochastic semidefinite programming
171 -- 175Jiejian Feng, Michael Zhang, Jinglei Yang. New necessary and sufficient condition for the irreducibility of joint inventory positions in an assemble-to-order system
176 -- 183Arindam Panja, Pradip Kundu, Biswabrata Pradhan. Stochastic comparisons of lifetimes of series and parallel systems with dependent and heterogeneous components
184 -- 187Jonathan Chamberlain, David Starobinski. Strategic revenue management of preemptive versus non-preemptive queues
188 -- 190Sheldon M. Ross. On the number of tests needed for the pooled testing halving scheme
191 -- 196Chen Jin, Qian Liu 0002, Chenguang (Allen) Wu. Selling multiple units to strategic consumers
197 -- 200Goran Banjac. On the minimal displacement vector of the Douglas-Rachford operator
201 -- 206Dimitris Bertsimas, Jack Dunn, Yuchen Wang. Near-optimal Nonlinear Regression Trees
207 -- 211Bara Kim, Jeongsim Kim. Comparison of socially optimal and profit maximizing prices in an unobservable queue with heterogeneous waiting costs
212 -- 217Katsunobu Sasanuma, Alan Scheller-Wolf. Approximate performance measures for a single station two-stage reneging queue
218 -- 225Jun Deng, Bin Zou 0005. Quadratic hedging for sequential claims with random weights in discrete time
226 -- 230Alberto Del Pia, Dion Gijswijt, Jeff Linderoth, Haoran Zhu. Integer packing sets form a well-quasi-ordering
231 -- 238Caleb Bugg, Anil Aswani. Logarithmic sample bounds for Sample Average Approximation with capacity- or budget-constraints
239 -- 245Danial Davarnia. Strong relaxations for continuous nonlinear programs based on decision diagrams
246 -- 249Christoph Dürr, Shahin Kamali. Randomized two-valued bounded delay online buffer management
250 -- 256Jason Rhuggenaath, Reza Refaei Afshar, Alp Akcay, Yingqian Zhang, Uzay Kaymak, Fatih Çolak, Muratcan Tanyerli. Maximizing revenue for publishers using header bidding and ad exchange auctions
257 -- 259Coulter Beeson, Neil Olver. A short proof of convexity of step-out-step-in sequencing games
260 -- 264Ben Amiet, Andrea Collevecchio, Kais Hamza. When "Better" is better than "Best"
265 -- 269Jie Jiang, Shengjie Li. On complexity of multistage stochastic programs under heavy tailed distributions
270 -- 277Vsevolod A. Afanasev, René van Bevern, Oxana Yu. Tsidulko. The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable
278 -- 282Wenzhong Li, Genjiu Xu. A dynamic transfer scheme deriving from the dual similar associated game
283 -- 289Nguyen Van Hung, Vo Minh Tam, Zhenhai Liu, Jen-Chih Yao. A novel approach to Hölder continuity of a class of parametric variational-hemivariational inequalities

Volume 49, Issue 1

1 -- 4Tomohito Fujii, Shuji Kijima. Every finite distributive lattice is isomorphic to the minimizer set of an M♮-concave set function
5 -- 10Qimeng Yu, Simge Küçükyavuz. A polyhedral approach to bisubmodular function minimization
11 -- 16Lei Guo. Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints
17 -- 22Sungjin Im, Benjamin Moseley, Kirk Pruhs. The matroid intersection cover problem
23 -- 29Ioannis Dimitriou. Analysis of the symmetric join the shortest orbit queue
30 -- 34Miguel F. Anjos, Y. Emine, Andrea Lodi 0001, Z. Sun. A note on the Lasserre hierarchy for different formulations of the maximum independent set problem
35 -- 39Xiaojuan Puyang, Ying Zhong. Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee
40 -- 47Henry Lam, Haidong Li, Xuhui Zhang. Minimax efficient finite-difference stochastic gradient estimators using black-box function evaluations
48 -- 54Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy. The Euclidean k-supplier problem in IR2
55 -- 61Xin Guo, Yi Zhang 0027. A useful technique for piecewise deterministic Markov decision processes
62 -- 68Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi 0001, Leen Stougie. Local improvement algorithms for a path packing problem: A performance analysis based on linear programming
69 -- 75Sheldon M. Ross, Sridhar Seshadri. An optimal stocking problem to minimize the expected time to sellout
76 -- 80Lukasz Kruk. Instability of LAS multiclass queueing networks
81 -- 83Jun Zhao, Jian Ni. A dynamic analysis of corporate investments and emission tax policy in an oligopoly market with network externality
84 -- 90Qingda Wei, Xian Chen. Average stochastic games for continuous-time jump processes
91 -- 95Ken R. Duffy, Seva Shneer. MDS coding is better than replication for job completion times
96 -- 100Tangi Migot, Monica-Gabriela Cojocaru. On Minty-variational inequalities and evolutionary stable states of generalized monotone games
101 -- 105Augusto Hasman. Does the financial market compensate investors for operational Losses?
106 -- 112Thomas A. Weber 0001. Minimum-error classes for matching parts
113 -- 120Gal Mendelson. A lower bound on the stability region of redundancy-d with FIFO service discipline
121 -- 128Derek Singh, Shuzhong Zhang. Distributionally robust profit opportunities
129 -- 135Alejandro Saavedra-Nieves. Statistics and game theory: Estimating coalitional values in R software
136 -- 143Gábor Pauer, Árpád Török. Binary integer modeling of the traffic flow optimization problem, in the case of an autonomous transportation system
144 -- 149Kaarthik Sundar, Harsha Nagarajan, Jeff T. Linderoth, Site Wang, Russell Bent. Piecewise polyhedral formulations for a multilinear term
150 -- 156Qijun Qiu, Li Jiang 0003. Firms can benefit from inaccurate market beliefs