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