| 3 | -- | 23 | O. Bahn, Jean-Louis Goffin, Jean-Philippe Vial, O. Du Merle. Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming |
| 25 | -- | 50 | Hans-Jürgen Bandelt, Yves Crama, Frits C. R. Spieksma. Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs |
| 51 | -- | 59 | Alain Billionnet, Marie-Christine Costa. Solving the Uncapacited Plant Location Problem on Trees |
| 61 | -- | 75 | Gary S. Bloom, Sergio Ruiz. Decompositions into Linear Forests and Difference Labelings of Graphs |
| 77 | -- | 93 | Endre Boros, Peter L. Hammer, Mark E. Hartmann, Ron Shamir. Balancing Problems in Acyclic Networks |
| 95 | -- | 105 | Richard C. Brewster. The Complexity of Colouring Symmetric Relational Systems |
| 107 | -- | 127 | Peter Brucker, Bernd Jurisch, Bernd Sievers. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem |
| 129 | -- | 141 | Philippe Chrétienne. Tree Scheduling with Communication Delays |
| 143 | -- | 163 | M. Chochand. Probabilistic Estimates for the Generalized Maximum Satisfiability Problem |
| 165 | -- | 174 | Dominique de Werra, Y. Gay. Chromatic Scheduling and Frequency Assignment |
| 175 | -- | 187 | Didier Fayard, Gérard Plateau. An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem |
| 189 | -- | 212 | Arnaud Fréville, Gérard Plateau. An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem |
| 213 | -- | 229 | Joseph A. Gallian. A Guide to the Graph Labeling Zoo |
| 231 | -- | 255 | Fred Glover. Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) |
| 257 | -- | 280 | Alain Hertz, Brigitte Jaumard, Marcus Poggi de Aragão. Local Optima Topology for the ::::k::::-Coloring Problem |
| 281 | -- | 297 | Bruno Leclerc. Medians for Weight Metrics in the Covering Graphs of Semilattices |
| 299 | -- | 308 | François Margot. Some Complexity Results about Threshold Graphs |
| 309 | -- | 323 | Uri N. Peled, Bruno Simeone. A O(::::nm::::)-Time Algorithm for Computing the Dual of a Regular Boolean Function |
| 325 | -- | 330 | Uri N. Peled, Feng Sun. Total Matchings and Total Coverings of Threshold Graphs |
| 331 | -- | 356 | Fred S. Roberts, Yonghua Xu. On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets |
| 357 | -- | 378 | Hanif D. Sherali, Sridhar Ramachandran, Seong-in Kim. A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem |