| 189 | -- | 191 | Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey. The Aussois 2000 workshop in combinatorial optimization introduction |
| 193 | -- | 206 | Martin Henk, Matthias Köppe, Robert Weismantel. Integral decomposition of polyhedra and some applications in mixed integer programming |
| 207 | -- | 220 | François Margot. Small covering designs by branch-and-cut |
| 221 | -- | 245 | Egon Balas, Michael Perregaard. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming |
| 247 | -- | 256 | Jon Lee, Joy Williams. A linear integer programming bound for maximum-entropy sampling |
| 257 | -- | 278 | Andrea Lodi, Michele Monaci. Integer linear programming models for 2-staged two-dimensional Knapsack problems |
| 279 | -- | 294 | Alberto Caprara, Adam N. Letchford. On the separation of split cuts and related inequalities |
| 295 | -- | 322 | Bram Verweij, Karen Aardal. The merchant subtour problem |
| 323 | -- | 341 | R. Hemmecke, R. Schultz. Decomposition of test sets in stochastic integer programming |
| 343 | -- | 359 | Ted K. Ralphs, L. Kopman, W. R. Pulleyblank, Leslie E. Trotter Jr.. On the capacitated vehicle routing problem |
| 361 | -- | 374 | Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger. Preemptive scheduling with rejection |
| 375 | -- | 405 | Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh. On the polyhedral structure of a multi-item production planning model with setup times |
| 407 | -- | 433 | Martin Zachariasen, André Rohe. Rectilinear group Steiner trees and applications in VLSI design |
| 435 | -- | 458 | Gunnar W. Klau, Petra Mutzel. Optimal labeling of point features in rectangular labeling models |
| 459 | -- | 466 | S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi. Easy and difficult objective functions for max cut |