| 129 | -- | 0 | Pierre Hansen, Dominique de Werra. Preface |
| 131 | -- | 142 | Warren E. Adams, Alain Billionnet, Alain Sutter. Unconstrained 0-1 optimization and Lagrangean relaxation |
| 143 | -- | 164 | Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel. Irreducible disjoint covering systems (with an application to boolean algebra) |
| 165 | -- | 170 | Vasek Chvátal, C. Ebenegger. A note on line digraphs and the directed max-cut problem |
| 171 | -- | 185 | Yves Crama, Pierre Hansen, Brigitte Jaumard. The basic algorithm for pseudo-Boolean programming revisited |
| 187 | -- | 193 | Pierre Hansen, Shi-Hui Lu, Bruno Simeone. On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization |
| 195 | -- | 210 | Michel Minoux, Kamel Barkaoui. Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems |
| 211 | -- | 219 | Uri N. Peled, Murali K. Srinivasan. Vicinal orders of trees |
| 221 | -- | 241 | Fred S. Roberts. Meaningfulness of conclusions from combinatorial optimization |
| 243 | -- | 250 | Bruno Simeone, Dominique de Werra, Maurice Cochand. Recognition of a class of unimodular functions |
| 251 | -- | 261 | Laurence A. Wolsey. Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints |