| 3 | -- | 19 | Paola Bertolazzi, Caterina De Simone, Anna Galluccio. A Nice Class for the Vertex Packing Problem |
| 21 | -- | 41 | Jacek Blazewicz, Maciej Drozdowski. Distributed Processing of Divisible Jobs with Communication Startup Costs |
| 43 | -- | 59 | Peter Brucker, Johann Hurink, Bernd Jurisch, Birgit Wöstmann. A Branch & Bound Algorithm for the Open-shop Problem |
| 61 | -- | 80 | Jacques Carlier, Yu Li, Jean-Luc Lutton. Reliability Evaluation of Large Telecommunication Networks |
| 81 | -- | 91 | Maurice Cochand, Arlette Gaillard, Heinz Gröflin. Optimum Partitioning into Intersections of Ring Families |
| 93 | -- | 101 | Dominique de Werra, Nadimpalli V. R. Mahadev. Preassignment Requirements in Chromatic Scheduling |
| 103 | -- | 121 | Mauro Dell Amico, Silvano Martello. The k-cardinality Assignment Problem |
| 123 | -- | 140 | Gerd Finke, H. Jiang. A Variant of the Permutation Flow Shop Model with Variable Processing Times |
| 141 | -- | 163 | Alain Gaillard. Switchdec Polyhedra |
| 165 | -- | 181 | Erwin Pesch, Fred Glover. TSP Ejection Chains |
| 183 | -- | 203 | Alain Hertz. On the Use of Boolean Methods for the Computation of the Stability Number |
| 205 | -- | 211 | Anthony J. W. Hilton, C. Zhao. Vertex-splitting and Chromatic Index Critical Graphs |
| 213 | -- | 223 | Marek Kubale. Open Shop Problem with Zero-one Time Operations and Integer Release Date/deadline Intervals |
| 225 | -- | 238 | Nadimpalli V. R. Mahadev, Fred S. Roberts. Amenable Colorings |
| 239 | -- | 253 | Maurice Queyranne, Frits C. R. Spieksma. Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs |