Skip to main content

A Polyhedral Study of the Mixed Integer Cut

  • Conference paper
Integer Programming and Combinatorial Optimization (IPCO 2010)

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

Abstract

General purpose cutting planes have played a central role in modern IP solvers. In practice, the Gomory mixed integer cut has proven to be among the most useful general purpose cuts. One may obtain this inequality from the group relaxation of an IP, which arises by relaxing non-negativity on the basic variables. We study the mixed integer cut as a facet of the master cyclic group polyhedron and characterize its extreme points and adjacent facets in this setting. Extensions are provided under automorphic and homomorphic mappings.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Aráoz, J., Evans, L., Gomory, R.E., Johnson, E.L.: Cyclic group and knapsack facets. Math. Program. 96(2), 377–408 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dash, S., Günlük, O.: On the strength of gomory mixed-integer cuts as group cuts. Math. Program. 115(2), 387–407 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications (2), 451–558 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gomory, R.E., Johnson, E.L., Evans, L.: Corner polyhedra and their connection with cutting planes. Math. Program. 96(2), 321–339 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tyber, S., Johnson, E.L. (2010). A Polyhedral Study of the Mixed Integer Cut. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13036-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13035-9

  • Online ISBN: 978-3-642-13036-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics