| 1 | -- | 9 | Donald L. Miller. A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems |
| 10 | -- | 23 | George Kontoravdis, Jonathan F. Bard. A GRASP for the Vehicle Routing Problem with Time Windows |
| 24 | -- | 35 | Moustapha Diaby, R. Ramesh. The Distribution Problem with Carrier Service: A Dual Based Penalty Approach |
| 36 | -- | 43 | Joseph Abate, Ward Whitt. Numerical Inversion of Laplace Transforms of Probability Distributions |
| 44 | -- | 62 | Stein W. Wallace, Roger J.-B. Wets. Preprocessing in Stochastic Programming: The Case of Capacitated Networks |
| 63 | -- | 77 | S. Thomas McCormick, Michael L. Pinedo. Scheduling ::::n:::: Independent Jobs on ::::m:::: Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis |
| 78 | -- | 83 | Dilip Chhajed, Vijay Chandru. Hulls and Efficient Sets for the Rectilinear Norm |
| 84 | -- | 88 | Thomas M. Liebling, François Margot, D. Müller, A. Prodon, L. Stauffer. Disjoint Paths in the Plane |
| 89 | -- | 100 | Lee K. Jones, Richard C. Larson. Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference |
| 101 | -- | 108 | Daniel P. Heyman, Meredith J. Goldsmith. Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain |
| 109 | -- | 116 | Kurt M. Bretthauer, Bala Shetty, Siddhartha Syam. A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems |