Journal: Oper. Res. Lett.

Volume 31, Issue 3

167 -- 175Amir Beck, Marc Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization
176 -- 178Satoru Fujishige. A maximum flow algorithm using MA ordering
179 -- 184Refael Hassin, Shlomi Rubinstein. Approximation algorithms for the metric maximum clustering problem with given cluster sizes
185 -- 194Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem
195 -- 201Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger. Local search for the minimum label spanning tree problem with bounded color classes
202 -- 210James M. Calvin, Joseph Y.-T. Leung. Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
211 -- 218Laureano F. Escudero, Araceli Garín, Gloria Pérez. An O(n log n) procedure for identifying facets of the knapsack polytope
219 -- 224Marjan van den Akker, Han Hoogeveen, Gerhard J. Woeginger. The two-machine open shop problem: To fit or not to fit, that is the question
225 -- 231Sixiang Hou, Han Hoogeveen. The three-machine proportionate flow shop problem with unequal machine speeds
232 -- 236Xiwen Lu, René Sitters, Leen Stougie. A class of on-line scheduling algorithms to minimize total completion time
237 -- 244Jeffrey P. Kharoufeh. Explicit results for wear processes in a Markovian environment
245 -- 253Fred Glover, Hanif D. Sherali. Foundation-penalty cuts for mixed-integer programs
254 -- 262Sem C. Borst, Onno J. Boxma, John A. Morrison, R. Núñez Queija. The equivalence between processor sharing and service in random order
263 -- 267Attahiru Sule Alfa. Waiting time distribution of the MAP/D/k system in discrete time - a more efficient algorithm
273 -- 276Michele Conforti, Refael Hassin, R. Ravi. Reconstructing edge-disjoint paths
277 -- 284Herminia I. Calvete, Lourdes del Pozo. The quickest path problem with batch constraints
285 -- 292Bahar Yetis Kara, Erhan Erkut, Vedat Verter. Accurate calculation of hazardous materials transport risks
293 -- 300Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura. Computing an obnoxious anchored segment
301 -- 307Young-Gun G, Young-Jo Seong, Maing-Kyu Kang. A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
308 -- 318Christoph J. Schuster, Jose M. Framinan. Approximative procedures for no-wait job shop scheduling
319 -- 322T. C. Edwin Cheng, Zhaohui Liu. Approximability of two-machine no-wait flowshop scheduling with availability constraints
323 -- 326C. T. Ng, T. C. Edwin Cheng, J. J. Yuan, Zhaohui Liu. On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
327 -- 334Chi-Kin Chau, Kwang Mong Sim. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
335 -- 340Geir Dahl, Njål Foldnes. Complete description of a class of knapsack polytopes
341 -- 342Paulo Bárcia, J. Orestes Cerdeira. Node packings on cocomparability graphs
343 -- 349Matthias Elf, Michael Jünger, Giovanni Rinaldi. Minimizing breaks by maximizing cuts
350 -- 356Marcus Oswald, Gerhard Reinelt. The weighted consecutive ones problem for a fixed number of rows or columns
357 -- 365David Ben-Arieh, Gregory Gutin, M. Penn, Anders Yeo, Alexey Zverovich. Transformations of generalized ATSP into ATSP
366 -- 374Woonghee Tim Huh, Ganesh Janakiraman, Peter L. Jackson, Nidhi Sawhney. Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound
375 -- 382Shane G. Henderson. Estimation for nonhomogeneous Poisson processes from aggregated data
383 -- 389Jacques Resing, Lerzan Örmeci. A tandem queueing model with coupled processors
390 -- 400Philipp Afèche. Delay performance in stochastic processing networks with priority service
401 -- 405Nikhil Bansal. Analysis of the M/G/1 processor-sharing queue with bulk arrivals
406 -- 412Hiroyuki Masuyama, Tetsuya Takine. Sojourn time distribution in a MAP/M/1 processor-sharing queue
413 -- 419Marc Uetz. When greediness fails: examples from stochastic scheduling
420 -- 428Michael O. Ball, Chien-Yu Chen, Zhen-Ying Zhao. Material compatibility constraints for make-to-order production planning
429 -- 434Paolo Ventura, Friedrich Eisenbrand. A compact linear program for testing optimality of perfect matchings
435 -- 441Yann Kieffer. The facets of the polytope of modules of a graph
442 -- 444Jan Brinkhuis. On the complexity of the primal self-concordant barrier method
445 -- 450Monica Bianchi, Rita Pini. A note on stability for parametric equilibrium problems
451 -- 458David Perry, Wolfgang Stadje. Duality of dams via mountain processes
459 -- 461Yong J. Kim, Michael V. Mannino. Optimal incentive-compatible pricing for M/G/1 queues
462 -- 472Hans Daduna, Ryszard Szekli. Dependence structure of sojourn times via partition separated ordering
473 -- 476Mohammed Abbad, Hatim Boustique. A decomposition algorithm for limiting average Markov decision problems
477 -- 482Jun Zhang. Managing multi-customer service level requirements with a simple rationing policy
483 -- 491George L. Vairaktarakis. On Gilmore-Gomory s open question for the bottleneck TSP
492 -- 496Yunpeng Pan. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

Volume 31, Issue 2

83 -- 89Shane G. Henderson, Peter W. Glynn. Nonexistence of a class of variate generation schemes
90 -- 94Alfred Müller. On the interplay between variability and negative dependence for bivariate distributions
95 -- 100Krishnan Kumaran, Michel Mandjes, Alexander L. Stolyar. Convexity properties of loss and overflow functions
101 -- 107Mohan L. Chaudhry, Nam K. Kim. A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times
108 -- 118Alexander N. Dudin, Valentina I. Klimenok. Optimal admission control in a queueing system with heterogeneous traffic
119 -- 123Jiahua Chen, Dennis K. J. Lin, Douglas J. Thomas. On the single item fill rate for a finite horizon
124 -- 128Jesús M. Jorge. Maximal descriptor set characterizations of efficient faces in multiple objective linear programming
129 -- 136Peter Brucker, Silvia Heitmann, Johann Hurink. How useful are preemptive schedules?
137 -- 141Cor A. J. Hurkens, Tjark Vredeveld. Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
142 -- 148Federico Della Croce, Vincent T Kindt. Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem
149 -- 160Stefano Pallottino, Maria Grazia Scutellà. A new algorithm for reoptimizing shortest paths when the arc costs change
161 -- 166Liping Zhang. On the convergence of a modified algorithm for the spherical facility location problem

Volume 31, Issue 1

1 -- 6Wolfgang Stadje. Renewal analysis of a replacement process
7 -- 11Mark Voorneveld. Characterization of Pareto dominance
12 -- 20Tobias Polzin, Siavash Vahdati Daneshmand. On Steiner trees and minimum spanning trees in hypergraphs
21 -- 27Marie-Christine Costa, Lucas Létocart, Frédéric Roupin. A greedy algorithm for multicut and integral multiflow in rooted trees
28 -- 34Tjark Vredeveld, Jan Karel Lenstra. On local search for the generalized graph coloring problem
35 -- 41Hans Kellerer, Vladimir Kotov. An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
42 -- 48Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng. On scheduling an unbounded batch machine
49 -- 52Mohamed Haouari, Anis Gharbi. An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
53 -- 59Stefan Chanas, Pawel Zielinski. On the hardness of evaluating criticality of activities in a planar network with duration intervals
60 -- 62Rafael Herrerías Pleguezuelo, José García Pérez, Salvador Cruz Rambaud. A note on the reasonableness of PERT hypotheses
63 -- 65Steven A. Lippman, Kevin F. McCardle. Comparative statics of cell phone plans
66 -- 76Huseyin Topaloglu, Warren B. Powell. An algorithm for approximating piecewise linear concave functions from sample gradients
77 -- 82Torpong Cheevaprawatdomrong, Robert L. Smith. A paradox in equipment replacement under technological improvement