Journal: Oper. Res. Lett.

Volume 24, Issue 5

205 -- 212Ward Whitt. Dynamic staffing in a telephone call center aiming to immediately answer all calls
213 -- 221Jayashankar M. Swaminathan, J. George Shanthikumar. Supplier diversification: effect of discrete demand
223 -- 234Yossi Aviv, Awi Federgruen. The value iteration method for countable state Markov decision processes
235 -- 243. Lifting theorems and facet characterization for a class of clique partitioning inequalities
245 -- 248E. G. Kyriakidis. Characterization of the optimal policy for the control of a simple immigration process through total catastrophes

Volume 24, Issue 4

149 -- 155Levent Tunçel. On the condition numbers for polyhedra in Karmarkar s form
157 -- 163Petra Schuurman, Gerhard J. Woeginger. Approximation algorithms for the multiprocessor open shop scheduling problem
165 -- 173Robert R. Goldberg, Jacob Shapiro. A tight upper bound for the ::::k::::-partition problem on ideal sets
175 -- 180Philippe Baptiste. An O(::::n:::::::4:::) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
181 -- 185C. M. Kenyon, S. Savage, B. Ball. Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions
187 -- 194Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs. An improved general procedure for lexicographic bottleneck problems
195 -- 203Dukwon Kim, Panos M. Pardalos. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

Volume 24, Issue 3

97 -- 103Ward Whitt. Decomposition approximations for time-dependent Markovian queueing networks
105 -- 114Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra. On dependent randomized rounding algorithms
115 -- 125Jayashankar M. Swaminathan, Ramesh Srinivasan. Managing individual customer service constraints under stochastic demand
127 -- 137Charles H. Rosa, Samer Takriti. Improving aggregation bounds for two-stage stochastic programs
139 -- 148Joaquín Acevedo, Efstratios N. Pistikopoulos. An algorithm for multiparametric mixed-integer linear programming problems

Volume 24, Issue 1-2

1 -- 10Ward Whitt. Using different response-time requirements to smooth time-varying demand for service
11 -- 14Bruce A. Reed. Edge coloring nearly bipartite graphs
15 -- 23O. L. Mangasarian. Arbitrary-norm separating plane
25 -- 28Dorit S. Hochbaum, Gerhard J. Woeginger. A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
29 -- 35Shoshana Anily, Julien Bramel, Alain Hertz. A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems
37 -- 45Claus C. Carøe, Rüdiger Schultz. Dual decomposition in stochastic integer programming
47 -- 56Wai-Kei Mak, David P. Morton, R. Kevin Wood. Monte Carlo bounding techniques for determining solution quality in stochastic programs
57 -- 63P. Das, N. R. Chakraborty, P. K. Chaudhuri. A polynomial time algorithm for a hemispherical minimax location problem
65 -- 72Jinn-Tsair Teng, Maw-Sheng Chern, Hui-Ling Yang, Yuchung J. Wang. Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand
73 -- 80Patrick Healy, Marcus Creavin, Ago Kuusik. An optimal algorithm for rectangle placement
81 -- 89Nicole Bäuerle. How to improve the performance of ATM multiplexers
91 -- 95Aziz Moukrim. Optimal scheduling on parallel machines for a new order class