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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aráoz, J., Evans, L., Gomory, R.E., Johnson, E.L.: Cyclic group and knapsack facets. Math. Program. 96(2), 377–408 (2003)
Dash, S., Günlük, O.: On the strength of gomory mixed-integer cuts as group cuts. Math. Program. 115(2), 387–407 (2008)
Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications (2), 451–558 (1969)
Gomory, R.E., Johnson, E.L., Evans, L.: Corner polyhedra and their connection with cutting planes. Math. Program. 96(2), 321–339 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)