Skip to main content
SpringerLink
Log in

Cuts from General Disjunctions

  • Chapter
  • First Online:
Disjunctive Programming

  • 1113 Accesses

Abstract

In the early years of the twenty-first century the topic of cutting planes from split disjunctions seemed to have been exhausted, and attention turned to cuts from more general (non-split) disjunctions.

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. K. Andersen, G. Cornuéjols, and Y. Li., Split closure and intersection cuts. Math. Prog. A, 102, 2005, 451–493.

    Google Scholar 

  2. K. Andersen, Q. Louveaux, R. Weismantel, R., L.A. Wolsey, Cutting planes from two rows of a simplex tableau. IPCO 12, Lecture Notes in Computer Science, 4513, Springer, 2007, 1–15.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. E. Balas, Integer programming and convex analysis: intersection cuts from outer polars. Mathematical Programming, 2, 1972, 330–382.

    Article  MathSciNet  Google Scholar 

  5. E. Balas, Disjunctive Programming: Properties of the Convex Hull of Feasible Points. MSRR No. 348, Carnegie Mellon University, July 1974.

    Google Scholar 

  6. E. Balas, Disjunctive Programming. Annals of Discrete Mathematics, 5, 1979, 3–51.

    Article  MathSciNet  Google Scholar 

  7. E. Balas, Multiple-term disjunctive cuts and intersection cuts from multiple rows of the simplex tableau. 20th International Symposium on Mathematical Programming, Chicago, August 23–28, 2009.

    Google Scholar 

  8. E. Balas, G. Cornuéjols, T. Kis, G. Nannicini, Combining Lift and Project and Reduce and Split. INFORMS Journal on Computing, 25, 2013, 475–487. https://doi.org/10.1287/ijoc.1120.0515

    Article  MathSciNet  Google Scholar 

  9. E. Balas and R.G. Jeroslow, Strengthening Cuts for Mixed Integer Programs. European Journal of Operations Research, 4, 1980, 224–234.

    Article  MathSciNet  Google Scholar 

  10. E. Balas and T. Kis, Intersection cuts–standard versus restricted. Discrete Optimization, 18 (2015), 189–192. https://doi.org/10.1016/j.disopt.2015.10.001

    Article  MathSciNet  Google Scholar 

  11. E. Balas and T. Kis, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Mathematical Programming A, 160, 2016, 85–114. https://doi.org/10.1007/s10107-015-0975-1

    Article  MathSciNet  Google Scholar 

  12. E. Balas and F. Margot, Generalized intersection cuts and a new cut generating paradigm. Mathematical Programming A, 137, 2013, 19–35. https://doi.org/10.1007/s10107-011-0483-x

    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 B, 94, 2003, 221–245.

    Article  MathSciNet  Google Scholar 

  14. E. Balas and A. Qualizza, Monoidal cut strengthening revisited. Discrete Optimization, 9, 2012, 40–49.

    Article  MathSciNet  Google Scholar 

  15. E. Balas and A. Qualizza, Intersection cuts from multiple rows: a disjunctive programming approach. European Journal of Computational Optimization, 1, 2013, 3–49. https://doi.org/10.1007/s13675-013-0008-x

    Article  Google Scholar 

  16. A. Basu, P. Bonami, G. Cornuéjols, F. Margot, On the Relative Strength of Split, Triangle and Quadrilateral Cuts. Mathematical Programming 126, 2009, 1220–1229.

    MathSciNet  MATH  Google Scholar 

  17. Borozan, V., Cornuéjols, G., Minimal valid inequalities for integer constraints. Mathematics of Operations Research, 34, 2009, 538–546.

    Article  MathSciNet  Google Scholar 

  18. M. Conforti, G. Cornuéjols and G. Zambelli, Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Letters, 38, 2010, 153–155.

    Article  MathSciNet  Google Scholar 

  19. M. Conforti, G. Cornuejols and G. Zambelli, Extended Formulations in Combinatorial Optimization. Annals of Operations Research, 204, 2013, 97–143. https://doi.org/10.1007/s10479-012-1269-0

    Article  MathSciNet  Google Scholar 

  20. G. Cornuéjols, F. Margot, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. Mathematical Programming A, 120, 2009, 429–456.

    Article  MathSciNet  Google Scholar 

  21. Dey, S., Wolsey, L.A., Two Row Mixed-Integer Cuts Via Lifting. Mathematical Programming B, 124, 2010, 143–174.

    Article  MathSciNet  Google Scholar 

  22. T. Kis, Lift-and-project for general two-term disjunctions. Discrete Optimization, 12, 2014, 98–114. https://doi.org/10.1016/j.disopt.2014.02.001

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA

    Egon Balas

Authors
  1. Egon Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Balas, E. (2018). Cuts from General Disjunctions. In: Disjunctive Programming. Springer, Cham. https://doi.org/10.1007/978-3-030-00148-3_11

Download citation

Publish with us

Policies and ethics

Search

Navigation