| 1 | -- | 2 | Martine Labbé, M. Grazia Speranza. Editorial |
| 3 | -- | 49 | Egon Balas, Andrea Qualizza. Intersection cuts from multiple rows: a disjunctive programming approach |
| 51 | -- | 69 | Florent Cadoux, Claude Lemaréchal. Reflections on generating (disjunctive) cuts |
| 71 | -- | 80 | Mathieu Van Vyve, Laurence A. Wolsey. Strong and compact relaxations in the original space using a compact extended formulation |
| 81 | -- | 115 | Ruslan Sadykov, François Vanderbeck. Column generation for extended formulations |
| 117 | -- | 142 | Patrice Marcotte, Gilles Savard, Alexandre Schoeb. A hybrid approach to the solution of a pricing model with continuous demand segmentation |
| 143 | -- | 153 | L. N. Vicente. Worst case complexity of direct search |
| 155 | -- | 180 | Dorit S. Hochbaum, Cheng Lyu, Erik Bertelli. Evaluating performance of image segmentation criteria and techniques |
| 181 | -- | 199 | Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen. Open problems on graph eigenvalues studied with AutoGraphiX |
| 201 | -- | 218 | Menal Guzelsoy, George L. Nemhauser, Martin W. P. Savelsbergh. Restrict-and-relax search for 0-1 mixed-integer programs |