1. Integer programming

   • Gérard Cornuéjols
   • William R. Pulleyblank

   OriginalPaper 07 May 2003 Pages: 1 - 2

2. Exploiting orbits in symmetric ILP

   • François Margot

   OriginalPaper 28 March 2003 Pages: 3 - 21

3. Local branching

   • Matteo Fischetti
   • Andrea Lodi

   OriginalPaper 28 March 2003 Pages: 23 - 47

4. Robust discrete optimization and network flows

   • Dimitris Bertsimas
   • Melvyn Sim

   OriginalPaper 07 May 2003 Pages: 49 - 71

5. Tight formulations for some simple mixed integer programs and convex objective integer programs

   • Andrew J. Miller
   • Laurence A. Wolsey

   OriginalPaper 10 April 2003 Pages: 73 - 88

6. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

   • J.-P.P. Richard
   • I.R. de Farias Jr
   • G.L. Nemhauser

   OriginalPaper 07 May 2003 Pages: 89 - 113

7. Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting

   • J.-P.P. Richard
   • I.R. de Farias Jr
   • G.L. Nemhauser

   OriginalPaper 07 May 2003 Pages: 115 - 143

8. On the facets of the mixed–integer knapsack polyhedron

   • Alper Atamtürk

   OriginalPaper 10 April 2003 Pages: 145 - 175

9. Facets of the independent set polytope

   • Todd Easton
   • Kevin Hooker
   • Eva K. Lee

   OriginalPaper 07 May 2003 Pages: 177 - 199

10. Binary clutter inequalities for integer programs

    • Adam N. Letchford

    OriginalPaper 28 March 2003 Pages: 201 - 221

11. The domino inequalities: facets for the symmetric traveling salesman polytope

    • Denis Naddef
    • Emmanuel Wild

    OriginalPaper 10 April 2003 Pages: 223 - 251

12. Parallel branch, cut, and price for large-scale discrete optimization

    • T.K. Ralphs
    • L. Ladányi
    • M.J. Saltzman

    OriginalPaper 10 April 2003 Pages: 253 - 280

13. An algorithm for mixed integer optimization

    • Matthias Köppe
    • Robert Weismantel

    OriginalPaper 28 March 2003 Pages: 281 - 307

14. Lift-and-project cuts and perfect graphs

    • Sebastián Ceria

    OriginalPaper 07 May 2003 Pages: 309 - 317

15. The stable set problem and the lift-and-project ranks of graphs

    • László Lipták
    • Levent Tunçel

    OriginalPaper 10 April 2003 Pages: 319 - 353

16. Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

    • Endre Boros
    • Khaled Elbassioni
    • Leonid Khachiyan

    OriginalPaper 10 April 2003 Pages: 355 - 368

17. Detecting symmetries by branch & cut

    • Christoph Buchheim
    • Michael Jünger

    OriginalPaper 07 May 2003 Pages: 369 - 384

18. The clustering matroid and the optimal clustering tree

    • Ephraim Korach
    • Michal Stern

    OriginalPaper 10 April 2003 Pages: 385 - 414

19. Max algebra and the linear assignment problem

    • Rainer E. Burkard
    • Peter Butkovič

    OriginalPaper 28 March 2003 Pages: 415 - 429

20. Asymptotic scheduling

    • Paolo Serafini

    OriginalPaper 28 March 2003 Pages: 431 - 444

21. Models and algorithms for a staff scheduling problem

    • Alberto Caprara
    • Michele Monaci
    • Paolo Toth

    OriginalPaper 10 April 2003 Pages: 445 - 476

22. Approximation algorithms for the test cover problem

    • K.M.J. De Bontridder
    • B.V. Halldórsson
    • L. Stougie

    OriginalPaper 07 May 2003 Pages: 477 - 491

23. The design of corporate tax structures

    • Simon Christofides
    • Alexander Christofides
    • Nicos Christofides

    OriginalPaper 10 April 2003 Pages: 493 - 510