Journal: Oper. Res. Lett.

Volume 34, Issue 5

481 -- 490Michele Aghassi, Dimitris Bertsimas, Georgia Perakis. Solving asymmetric variational inequalities via convex optimization
491 -- 498Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, Dries Vermeulen. The communication complexity of private value single-item auctions
499 -- 507Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha. Min-Max payoffs in a two-player location game
508 -- 516Ningxiong Xu. Flexible supply policy with options and capacity constraints
517 -- 524Ju-liang Zhang, Jian Chen. Bayesian solution to pricing and inventory control under unknown demand distribution
525 -- 530Delia Montoro-Cazorla, Rafael Pérez-Ocón. Reliability of a system under two types of failures using a Markovian arrival process
531 -- 538Jiyeon Lee, Jongwoo Kim. A workload-dependent ::::M::::/::::G::::/1 queue under a two-stage service policy
539 -- 547A. D. Banik, U. C. Gupta, S. S. Pathak. Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process
548 -- 556Che Soong Kim, Aliaksandr Kanechny, Alexander N. Dudin. Threshold control by a single-server retrial queue with batch arrivals and group services
557 -- 563Javiera Barrera, Thierry Huillet, Christian Paroissin. Limiting search cost distribution for the move-to-front rule with random request probabilities
564 -- 568Friedrich Eisenbrand, Gennady Shmonin. Carathéodory bounds for integer cones
569 -- 576Hatem Ben Amor, Jacques Desrosiers, François Soumis. Recovering an optimal LP basis from an optimal dual solution
577 -- 582Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau. On the ::::k:::: edge-disjoint 2-hop-constrained paths polytope
583 -- 590Tobias Brüggemann, Johann Hurink, Walter Kern. Quality of move-optimal schedules for minimizing total weighted completion time
591 -- 598Francis Sourd. Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints