1. On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}

   • Egon Balas
   • Shu Ming Ng

   OriginalPaper Pages: 1 - 20

2. Facets of the balanced (acyclic) induced subgraph polytope

   • Francisco Barahona
   • Ali Ridha Mahjoub

   OriginalPaper Pages: 21 - 33

3. On ternary problems

   • Sunil Chopra

   OriginalPaper Pages: 35 - 47

4. Forest covers and a polyhedral intersection theorem

   • A. B. Gamble
   • W. R. Pulleyblank

   OriginalPaper Pages: 49 - 58

5. A cutting plane algorithm for a clustering problem

   • M. Grötschel
   • Y. Wakabayashi

   OriginalPaper Pages: 59 - 96

6. A generalization of antiwebs to independence systems and their canonical facets

   • Monique Laurent

   OriginalPaper Pages: 97 - 108

7. The hirsch conjecture is true for (0, 1)-polytopes

   • Denis Naddef

   OriginalPaper Pages: 109 - 110

8. Facets and lifting procedures for the set covering polytope

   • Paolo Nobili
   • Antonio Sassano

   OriginalPaper Pages: 111 - 137

9. The boolean quadric polytope: Some characteristics, facets and relatives

   • Manfred Padberg

   OriginalPaper Pages: 139 - 172

10. Strong formulations for mixed integer programming: A survey

    • Laurence Wolsey

    OriginalPaper Pages: 173 - 191

11. Algorithms for proportional matrices in reals and integers

    • M. L. Balinski
    • G. Demange

    OriginalPaper Pages: 193 - 210

12. Multi-constrained matroidal knapsack problems

    • P. M. Camerini
    • F. Maffioli
    • C. Vercellis

    OriginalPaper Pages: 211 - 231

13. New lower bounds for the Symmetric Travelling Salesman Problem

    • G. Carpaneto
    • M. Fischetti
    • P. Toth

    OriginalPaper Pages: 233 - 254

14. On the geometric structure of independence systems

    • Michele Conforti
    • Monique Laurent

    OriginalPaper Pages: 255 - 277

15. Odd cycles and matrices with integrality properties

    • Michele Conforti
    • M. R. Rao

    OriginalPaper Pages: 279 - 294

16. On the supermodular knapsack problem

    • G. Gallo
    • B. Simeone

    OriginalPaper Pages: 295 - 309

17. Four problems on graphs with excluded minors

    • Huiling Gan
    • Ellis L. Johnson

    OriginalPaper Pages: 311 - 330

18. Facets and algorithms for capacitated lot sizing

    • Janny M. Y. Leung
    • Thomas L. Magnanti
    • Rita Vachani

    OriginalPaper Pages: 331 - 359

19. Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications

    • M. Minoux

    OriginalPaper Pages: 361 - 372

20. A direct active set algorithm for large sparse quadratic programs with simple bounds

    • Thomas F. Coleman
    • Laurie A. Hulbert

    OriginalPaper Pages: 373 - 406

21. Some numerical experiments with variable-storage quasi-Newton algorithms

    • Jean Charles Gilbert
    • Claude Lemaréchal

    OriginalPaper Pages: 407 - 435

22. A practical anti-cycling procedure for linearly constrained optimization

    • Philip E. Gill
    • Walter Murray
    • Margaret H. Wright

    OriginalPaper Pages: 437 - 474

23. New crash procedures for large systems of linear constraints

    • Nicholas I. M. Gould
    • John K. Reid

    OriginalPaper Pages: 475 - 501

24. On the limited memory BFGS method for large scale optimization

    • Dong C. Liu
    • Jorge Nocedal

    OriginalPaper Pages: 503 - 528

25. Block truncated-Newton methods for parallel optimization

    • Stephen G. Nash
    • Ariela Sofer

    OriginalPaper Pages: 529 - 546

26. A tolerant algorithm for linearly constrained optimization calculations

    • M. J. D. Powell

    OriginalPaper Pages: 547 - 566