Skip to main content
SpringerLink
Log in

Disjunctive Programming

  • Chapter
  • First Online:
50 Years of Integer Programming 1958-2008

Abstract

In April 1967 I and my family arrived into the US as fresh immigrants from behind the Iron Curtain. After a fruitful semester spent with George Dantzig’s group in Stanford, I started working at CMU. My debut in integer programming and entry ticket into Academia was the additive algorithm for 0-1 programming [B65], an implicit enumeration procedure based on logical tests akin to what today goes under the name of constraint propagation. As it used only additions and comparisons, it was easy to implement and was highly popular for a while. However, I was aware of its limitations and soon after I joined CMU I started investigating cutting plane procedures, trying to use for this purpose the tools of convex analysis: support functions and their level sets, maximal convex extensions, polarity, etc.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Atamtürk, Strong formulations of robust mixed 0-1 programming, Mathematical Programming 108 (2006) 235–250.

    Article  MathSciNet  Google Scholar 

  2. K. Andersen, Q. Louveaux, R. Weismantel and L.A. Wolsey, Inequalities from two rows of the simplex tableau, Integer Programming and Combinatorial Optimization IPCO 12 (M. Fischetti and D.P. Williamson, eds.), Springer, 2007, pp. 1–16.

    Google Scholar 

  3. E. Balas, An additive algorithm for solving linear programs in 0-1 variables, Operations Research 13 (1965) 517–546.

    Article  MathSciNet  Google Scholar 

  4. E. Balas, Disjunctive programming and a hierarchy of relaxations for discrete optimization problems, SIAM Journal on Algebraic and Discrete Methods 6 (1985) 466–486.

    Article  MathSciNet  Google Scholar 

  5. E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Invited paper with a Foreword by G. Cornuéjols and G. Pulleyblank, Discrete Applied Mathematics 89 (1998) 1–44.

    Article  MathSciNet  Google Scholar 

  6. E. Balas and P. Bonami, New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing, Integer Programming and Combinatorial Oprtimization IPCO 12 (M. Fischetti and D.P. Williamson, eds.), Springer, 2007, pp. 89–103.

    Google Scholar 

  7. V. Borozan and G. Cornuéjols, Minimal inequalities for integer constraints, Technical Report, Tepper School, Carnegie Mellon University, 2007.

    Google Scholar 

  8. E. Balas, S. Ceria and G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming 58 (1993) 295–324.

    Article  MathSciNet  Google Scholar 

  9. E. Balas, S. Ceria, G. Cornuéjols and N. Natraj, Gomory cuts revisited, Operations Research Letters 19 (1996) 1–10.

    Article  MathSciNet  Google Scholar 

  10. M. Ball, W. Liu and W.R. Pulleyblank, Two-terminal Steiner tree polyhedra, Contributions to Operations Research and Economics, MIT Press, 1989, pp. 251–284.

    Google Scholar 

  11. E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983) 495–516.

    Article  MathSciNet  Google Scholar 

  12. E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of an arbitrary graph, Combinatorica 9 (1989) 321–337.

    Article  MathSciNet  Google Scholar 

  13. E. Balas and M. Perregaard, A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming, Mathematical Programming 94 (2003) 221–245.

    Article  MathSciNet  Google Scholar 

  14. G. Cornuéjols and F. Margot, On the facets of mixed integer programs with two integer variables and two constraints, Technical Report, Tepper School, Carnegie Mellon University, 2007.

    Google Scholar 

  15. [COIN-OR] http://www.coin-or.org

  16. M. Conforti and L.A. Wolsey, Compact formulations as a union of polyhedra, Mathematical Programming 114 (2008) 277–289.

    Article  MathSciNet  Google Scholar 

  17. S.S. Dey and L.A. Wolsey, Lifting integer variables in minimal inequalities corresponding to lattice-free triangles, Integer Programming and Combinatorial Optimization IPCO 13 (A. Lodi, A. Panconesi, and G. Rinaldi, eds.), Springer, 2008, pp. 463–475.

    Google Scholar 

  18. L. Lovász and A. Schrijver, Cones of matrices and set functions and 0-1 optimization, SIAM Journal of Optimization 1 (1991) 166–190.

    Article  MathSciNet  Google Scholar 

  19. M. Perregaard, A Practical implementation of lift-and-project cuts: a computational exploration of lift-and-project with XPRESS-MP, International Symposium onMathematical Programming, Copenhagen, August 2003.

    Google Scholar 

  20. Y. Pochet and L.A. Wolsey, Production Planning by Mixed Integer Programming, Springer, 2006.

    Google Scholar 

  21. R. Stubbs and S. Mehrotra, A branch and cut method for 0-1 mixed integer convex programming, Mathematical Programming 86 (1999) 515–532.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, USA

    Egon Balas

Authors
  1. Egon Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Egon Balas .

Editor information

Editors and Affiliations

  1. Inst. Informatik, Universität Köln, Pohligstr. 1, Köln, 50969, Germany

    Michael Jünger

  2. Fac. Sciences de Base (FSB), Ecole Polytechnique Fédérale de Lausanne, Lausanne, 1015, Switzerland

    Thomas M. Liebling

  3. Ensimag, Institut Polytechnique de Grenoble, avenue Félix Viallet 46, Grenoble CX 1, 38031, France

    Denis Naddef

  4. School of Industrial &, Georgia Institute of Technology, Ferst Drive NW., 765, Atlanta, 30332-0205, USA

    George L. Nemhauser

  5. IBM Corporation, Route 100 294, Somers, 10589, USA

    William R. Pulleyblank

  6. Inst. Informatik, Universität Heidelberg, Im Neuenheimer Feld 326, Heidelberg, 69120, Germany

    Gerhard Reinelt

  7. ed Informatica, CNR - Ist. Analisi dei Sistemi, Viale Manzoni 30, Roma, 00185, Italy

    Giovanni Rinaldi

  8. Center for Operations Reserach &, Université Catholique de Louvain, voie du Roman Pays 34, Leuven, 1348, Belgium

    Laurence A. Wolsey

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Balas, E. (2010). Disjunctive Programming. In: Jünger, M., et al. 50 Years of Integer Programming 1958-2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68279-0_10

Download citation

Publish with us

Policies and ethics

Search

Navigation