Skip to main content
SpringerLink
Log in

Towards a MIP-Cut Metascheme

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6140))

  • 1854 Accesses

Abstract

Cutting planes (cuts) are very popular in the OR community, where they are used to strengthen the Linear Programming (LP) relaxation of Mixed-Integer Programs (MIPs) in the hope of improving the performance of an exact LP-based solver. In particular, an intense research effort has been devoted to the study of families of general cuts, whose validity does not require the presence of a specific MIP structure—as opposed to problem-specific cuts such as, e.g., subtour elimination or comb inequalities for the traveling salesman problem.

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 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

Institutional subscriptions

References

  1. Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Cooperation (1960)

    Google Scholar 

  2. Cornuéjols, G.: Revival of the Gomory cuts in the 1990’s. Annals of Operations Research 149(1), 63–66 (2006)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Zanette, A., Fischetti, M., Balas, E.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Mathematical Programming (2009), doi:10.1007/s10107-009-0300-y

    Google Scholar 

  5. Balas, E., Fischetti, M., Zanette, A.: On the enumerative nature of Gomory’s dual cutting plane method. Mathematical Programming B (to appear, 2010)

    Google Scholar 

  6. Fischetti, M., Salvagnin, D.: A relax-and-cut framework for Gomory’s mixed-integer cuts. In: CPAIOR 2010 Proceedings (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEI, University of Padova, Italy

    Matteo Fischetti

Authors
  1. Matteo Fischetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Andrea Lodi , Michela Milano  & Paolo Toth ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischetti, M. (2010). Towards a MIP-Cut Metascheme. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13520-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13519-4

  • Online ISBN: 978-3-642-13520-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation