Skip to main content
SpringerLink
Log in
Book cover

International Conference on Integer Programming and Combinatorial Optimization

IPCO 1998: Integer Programming and Combinatorial Optimization pp 271–283Cite as

Solving Integer and Disjunctive Programs by Lift and Project

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1412))

Abstract

We extend the theoretical foundations of the branch-and-cut method using lift-and-project cuts for a broader class of disjunctive con- straints, and also present a new, substantially improved disjunctive cut generator. Employed together with an efficient commercial MIP solver, our code is a robust, general purpose method for solving mixed integer programs. We present extensive computational experience with the most difficult problems in the MIPLIB library.

Both authors were supported by NSF grant DMS 95-27-124

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Avella and F. Rossi. Private communication.

    Google Scholar 

  2. G. Astfalk and R. Bixby. Private communication.

    Google Scholar 

  3. E. Balas. Intersection cuts — A new type of cutting planes for integer programming. Operations Research, 19:19–39, 1971.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Balas. Disjunctive programming: Facets of the convex hull of feasible points. Technical Report No. 348, GSIA, Carnegie Mellon University, 1974.

    Google Scholar 

  5. E. Balas. Disjunctive programming. Annals of Discrete Mathematics, 5:3–51, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Alg. Disc. Meth., 6:466–486, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  7. E. Balas. Enhancements of lift-and-project. Technical Report, GSIA, Carnegie Mellon University, 1997.

    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:295–324, 1993.

    Article  MathSciNet  Google Scholar 

  9. E. Balas, S. Ceria, and G. Cornuéjols. Mixed 0–1 Programming by lift-ad-project in a branch-and-cut framework. Management Science, 42:1229–1246, 1996.

    MATH  Google Scholar 

  10. E. Balas, S. Ceria, G. Cornuéjols, and G. Pataki. Polyhedral Methods for the Maximum Clique Problem. AMS, DIMA CS Series on Discrete Mathematics and Computer Science, 26:11–28, 1996.

    Google Scholar 

  11. N. Beaumont. An algorithm for disjunctive programs. European Journal of Operational Research, 48:362–371, 1990.

    Article  MATH  Google Scholar 

  12. C. Blair. Two rules for deducing valid inequalities for 0–1 problems. SIAM Journal of Applied Mathematics, 31:614–617, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  13. S. Ceria and J. Soares. Disjunctive cuts for mixed 0–1 programming: Duality and lifting. Working paper, Graduate School of Business, Columbia University, 1997.

    Google Scholar 

  14. S. Ceria and J. Soares. Convex programming for disjunctive optimization. Working paper, Graduate School of Business, Columbia University, 1997.

    Google Scholar 

  15. J. Hooker. Logic based methods for optimization. In A. Borning, editor, Principles and practice of constraint programming, LNCS, Vol. 626, pages 184–200, 1992.

    Google Scholar 

  16. J. Hooker, M. Osorio. Mixed logical/linear programming. Technical report, GSIA, Carnegie Mellon University, 1997.

    Google Scholar 

  17. J. Hooker, H. Yan, I. Grossman, and R. Raman. Logic cuts for processing networks with fixed charges. Computers and Operations Research, 21:265–279, 1994.

    Article  MATH  Google Scholar 

  18. R. Jeroslow. Representability in mixed-integer programming I: Characterization results. Discrete Applied Mathematics, 17:223–243, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  19. R. Jeroslow. Logic based decision support: Mixed-integer model formulation. Annals of Discrete Mathematics, 40, 1989.

    Google Scholar 

  20. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optimization, 1:166–190, 1991.

    Article  MATH  Google Scholar 

  21. R. Meyer. Integer and mixed-integer programming models: General properties. Journal of Optimization Theory and Applications, 16:191–206, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  22. H. Sherali and W. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math., 3:411–430, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  23. H. Sherali and C. Shetty. Optimization with disjunctive constraints, In M. Beckman and H. Kunzi, editors, Lecture notes in Economics and Mathematical Systems, Vol. 181. Springer-Verlag, 1980.

    Google Scholar 

  24. J. Soares. Disjunctive Methods for Discrete Optimization Problems, PhD thesis, Graduate School of Business, Columbia University, 1997. In preparation.

    Google Scholar 

  25. H. P. Williams. An alternative explanation of disjunctive formulations. European Journal of Operational Research, 72:200–203, 1994.

    Article  MATH  Google Scholar 

  26. L. Wolsey. Private communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Business, and Computational Optimization Research Center, Columbia University, New York, NY, 10027, USA

    Sebastián Ceria

  2. Department of Industrial Engineering and Operations Research, and Computational Optimization Research Center, Columbia University, New York, NY, 10027, USA

    Gábor Pataki

Authors
  1. Sebastián Ceria
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Pataki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computational and Applied Mathematics, Rice University, 6020 Annapolis, Houston, TX, 77005, USA

    Robert E. Bixby

  2. PROS Strategic Solutions, 3223 Smith Street, Houston, TX, 77006, USA

    E. Andrew Boyd

  3. Department of Industrial, Engineering, Texas A&M University, 1000 Country Place Dr. Apt. 69, Houston, TX, 77079, USA

    Roger Z. Ríos-Mercado

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ceria, S., Pataki, G. (1998). Solving Integer and Disjunctive Programs by Lift and Project. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds) Integer Programming and Combinatorial Optimization. IPCO 1998. Lecture Notes in Computer Science, vol 1412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69346-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-69346-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64590-0

  • Online ISBN: 978-3-540-69346-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation