| 1 | -- | 2 | Gérard Cornuéjols, William R. Pulleyblank. Integer programming |
| 3 | -- | 21 | François Margot. Exploiting orbits in symmetric ILP |
| 23 | -- | 47 | Matteo Fischetti, Andrea Lodi. Local branching |
| 49 | -- | 71 | Dimitris Bertsimas, Melvyn Sim. Robust discrete optimization and network flows |
| 73 | -- | 88 | Andrew J. Miller, Laurence A. Wolsey. Tight formulations for some simple mixed integer programs and convex objective integer programs |
| 89 | -- | 113 | Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms |
| 115 | -- | 143 | Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser. Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting |
| 145 | -- | 175 | Alper Atamtürk. On the facets of the mixed-integer knapsack polyhedron |
| 177 | -- | 199 | Todd Easton, Kevin Hooker, Eva K. Lee. Facets of the independent set polytope |
| 201 | -- | 221 | Adam N. Letchford. Binary clutter inequalities for integer programs |
| 223 | -- | 251 | Denis Naddef, Emmanuel Wild. The domino inequalities: facets for the symmetric traveling salesman polytope |
| 253 | -- | 280 | Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman. Parallel branch, cut, and price for large-scale discrete optimization |
| 281 | -- | 307 | Matthias Köppe, Robert Weismantel. An algorithm for mixed integer optimization |
| 309 | -- | 317 | Sebastián Ceria. Lift-and-project cuts and perfect graphs |
| 319 | -- | 353 | László Lipták, Levent Tunçel. The stable set problem and the lift-and-project ranks of graphs |
| 355 | -- | 368 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices |
| 369 | -- | 384 | Christoph Buchheim, Michael Jünger. Detecting symmetries by branch & cut |
| 385 | -- | 414 | Ephraim Korach, Michal Stern. The clustering matroid and the optimal clustering tree |
| 415 | -- | 429 | Rainer E. Burkard, Peter Butkovic. Max algebra and the linear assignment problem |
| 431 | -- | 444 | Paolo Serafini. Asymptotic scheduling |
| 445 | -- | 476 | Alberto Caprara, Michele Monaci, Paolo Toth. Models and algorithms for a staff scheduling problem |
| 477 | -- | 491 | Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie. Approximation algorithms for the test cover problem |
| 493 | -- | 510 | Simon Christofides, Alexander Christofides, Nicos Christofides. The design of corporate tax structures |