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