| 105 | -- | 0 | Ruy Eduardo Campello, Gerd Finke. Preface |
| 107 | -- | 117 | Paulo Bárcia. Constructive dual methods for discrete programming |
| 119 | -- | 136 | Ruy Eduardo Campello, Nelson Maculan. Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms |
| 137 | -- | 153 | Giorgio Carpaneto, Paolo Toth. Primal-dual algrorithms for the assignment problem |
| 155 | -- | 165 | Chandra R. Chegireddy, Horst W. Hamacher. Algorithms for finding K-best perfect matchings |
| 167 | -- | 174 | Søren Holm. Adding activities to the dual instead of cuts to the primal problem |
| 175 | -- | 184 | Andrew Kusiak, Gerd Finke. Hierarchical approach to the process planning problem |
| 185 | -- | 197 | Gilbert Laporte, Hélène Mercure, Yves Nobert. Generalized travelling salesman problem through n sets of nodes: the asymmetrical case |
| 199 | -- | 210 | Henrique Pacca L. Luna, Nivio Ziviani, Regina Helena B. Cabral. The telephonic switching centre network problem: formalization and computational experience |
| 211 | -- | 225 | Catherine Roucairol. A parallel branch and bound algorithm for the quadratic assignment problem |
| 227 | -- | 233 | Jayme Luiz Szwarcfiter. Job shop scheduling with unit time operations under resource constraints and release dates |
| 235 | -- | 245 | Horacio Hideki Yanasse, Nei Yoshihiro Soma. A new enumeration scheme for the knapsack problem |