| 119 | -- | 0 | Giulia Galbiati, Francesco Maffioli. Preface |
| 121 | -- | 122 | Francesco Maffioli. In Memoriam Paolo M. Camerini |
| 123 | -- | 138 | Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello. Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints |
| 139 | -- | 145 | Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty. Note on Combinatorial Optimization with Max-Linear Objective Functions |
| 147 | -- | 175 | Brenda L. Dietrich, Laureano F. Escudero, F. Chance. Efficient Reformulation for 0-1 Programs - Methods and Computational Results |
| 177 | -- | 201 | Giorgio Gallo, Giustino Longo, Stefano Pallottino. Directed Hypergraphs and Applications |
| 203 | -- | 210 | Dorit S. Hochbaum. Why Should Biconnected Components be Identified First |
| 211 | -- | 225 | Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh. Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem |
| 227 | -- | 256 | Mario Lucertini, Yehoshua Perl, Bruno Simeone. Most Uniform Path Partitioning and its Use in Image Processing |
| 257 | -- | 269 | Philippe Michelon, Nelson Maculan. Lagrangean Methods for 0-1 Quadratic Problems |
| 271 | -- | 278 | Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis. Computing the Throughput of a Network with Dedicated Lines |
| 279 | -- | 290 | A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis. A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem |
| 291 | -- | 303 | Leen Stougie. A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length |