| 125 | -- | 137 | Alberto Caprara, David Pisinger, Paolo Toth. Exact Solution of the Quadratic Knapsack Problem |
| 138 | -- | 148 | William Cook, André Rohe. Computing Minimum-Weight Perfect Matchings |
| 149 | -- | 160 | Jeffery L. Kennington, Jason E. Whitler. An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network |
| 161 | -- | 172 | James P. Kelly, Jiefeng Xu. A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem |
| 173 | -- | 187 | Jeff T. Linderoth, Martin W. P. Savelsbergh. A Computational Study of Search Strategies for Mixed Integer Programming |
| 188 | -- | 197 | Larry J. Leblanc, Jerome Chifflet, Philippe Mahey. Packet Routing in Telecommunication Networks with Path and Flow Restrictions |
| 198 | -- | 204 | Charles Fleurent, Fred Glover. Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory |
| 205 | -- | 210 | Gérard Cornuéjols, Milind Dawande. A Class of Hard Small 0-1 Programs |
| 211 | -- | 216 | Gerhard J. Woeginger. An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine |