Operations Research Letters, Volume 24

Volume 24, Numbers 1-2, February 1999

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

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

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

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

Last update Sat May 18 17:07:43 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page