| 1 | -- | 0 | Martine Labbé, Gilbert Laporte, Silvano Martello. Preface |
| 3 | -- | 10 | Mourad Baïou. On the dominant of the Steiner 2-edge connected subgraph polytope |
| 11 | -- | 26 | Ralf Borndörfer, Robert Weismantel. Discrete relaxations of combinatorial programs |
| 27 | -- | 52 | Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey. Scheduling projects with labor constraints |
| 53 | -- | 72 | Giuseppe Confessore, Paolo Dell Olmo, Stefano Giordani. An approximation result for a periodic allocation problem |
| 73 | -- | 99 | Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design |
| 101 | -- | 120 | Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub. Steiner trees and polyhedra |
| 121 | -- | 128 | Samuel Fiorini. Determining the automorphism group of the linear ordering polytope |
| 129 | -- | 145 | Luis Gouveia, Jose Manuel Pires. The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints |
| 147 | -- | 178 | Mark E. Hartmann, Özgür Özlük. Facets of the p-cycle polytope |
| 179 | -- | 197 | Johann Hurink, Jens Keuchel. Local search algorithms for a single-machine scheduling problem with positive and negative time-lags |
| 199 | -- | 216 | Johann Hurink, Sigrid Knust. Makespan minimization for flow-shop problems with transportation times and a single robot |
| 217 | -- | 240 | Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor. Comparison of column generation models for channel assignment in cellular networks |
| 241 | -- | 261 | Tobias Polzin, Siavash Vahdati Daneshmand. A comparison of Steiner tree relaxations |
| 263 | -- | 300 | Tobias Polzin, Siavash Vahdati Daneshmand. Improved algorithms for the Steiner problem in networks |
| 301 | -- | 328 | H. Edwin Romeijn, Dolores Romero Morales. A probabilistic analysis of the multi-period single-sourcing problem |