Journal: Oper. Res. Lett.

Volume 33, Issue 1

1 -- 8Christian Malchin, Hans Daduna. An invariance property of sojourn times in cyclic networks
9 -- 16Wendell G. Gilland. Analysis of optimal and nearly optimal sequencing policies for a closed queueing network
17 -- 25Tava Lennon Olsen, Robert D. van der Mei. Polling systems with periodic server routing in heavy traffic: renewal arrivals
26 -- 34Vladimir V. Anisimov. Asymptotic analysis of stochastic block replacement policies for multicomponent systems in a Markov environment
35 -- 41László Lipták, Levent Tunçel. Lift-and-project ranks and antiblocker duality
42 -- 54Tobias Achterberg, Thorsten Koch, Alexander Martin. Branching rules revisited
55 -- 61Warren P. Adams, Richard J. Forrester. A simple recipe for concise mixed 0-1 linearizations
62 -- 70Subhash C. Sarin, Hanif D. Sherali, Ajay Bhootra. New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
71 -- 76Refael Hassin, Shlomi Rubinstein. On the complexity of the ::::k::::-customer vehicle routing problem
77 -- 80Yupei Xiong, Bruce L. Golden, Edward A. Wasil. Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
81 -- 89Erhan Erkut, Armann Ingolfsson. Transport risk models for hazardous materials: revisited
90 -- 96Peng-Sheng You. Optimal replenishment policy for product with season pattern demand
97 -- 104Irwin E. Schochetman, Robert L. Smith. Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls
105 -- 110Tamás Kis. Project scheduling: a review of recent books