Abstract
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Gomory-Johnson characterization on the master cyclic group polyhedron. To our knowledge, the practical benefit that can be obtained by embedding interpolated subadditive cuts in a cutting plane algorithm was not investigated computationally by previous authors. In this paper we compute, for the first time, the lower bound value obtained when adding (implicitly) all the interpolated subadditive cuts that can be derived from the individual rows of an optimal LP tableau, thus approximating the optimization over the so-called Gomory’s Corner polyhedron. The computed bound is compared with that obtained when only Gomory mixed-integer cuts are used, on a large test-bed of MIPLIB instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreello, G., Caprara, A., Fischetti, M.: Embedding Cuts in a Branch and Cut Framework: a Computational Study with {0,1/2}-Cuts, Technical Report, University of Padova, available at (2003), http://www.dei.unipd.it/~fisch/papers
Araoz, J., Gomory, R.E., Johnson, E.L., Evans, L.: Cyclic group and knapsack facets. Mathematical Programming 96, 377–408 (2003)
Balas, E., Ceria, S., Cornuejols, G., Natraj, N.: Gomory Cuts Revisited. Operations Research Letters 19, 1–9 (1996)
Cornuejols, G., Li, Y., Vandenbussche, D.: K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. INFORMS Journal on Computing 15, 385–396 (2003)
Dash, S., Gunluk, O.: Valid inequalities based on simple mixed-integer sets, IBM Research Report RC22922, T. J. Watson Research Center, Yorktown Heights, New York (2003)
Dash, S., Gunluk, O.: Valid inequalities based on the interpolation procedure, IBM Research Report RC22922, T. J. Watson Research Center, Yorktown Heights, New York (2004)
Evans, L.: Cyclic Groups and Knapsack Facets with Applications to Cutting Planes, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia (2002)
Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the AMS 64, 275–278 (1958)
Gomory, R.E.: An algorithm for the mixed-integer problem. Report RM-2597, Rand Corporation (1960)
Gomory, R.E.: Some Polyhedra Related to Combinatorial Problems. Journal of Linear Algebra and its Applications 2, 451–558 (1969)
Gomory, R.E., Johnson, E.L.: Some Continuous Functions Related to Corner Polyhedra I. Mathematical Programming 3, 23–85 (1972)
Gomory, R.E., Johnson, E.L.: Some Continuous Functions Related to Corner Polyhedra II. Mathematical Programming 3, 359–389 (1972)
Gomory, R.E., Johnson, E.L.: T-space and cutting planes. Mathematical Programming 96, 341–375 (2003)
Gomory, R.E., Johnson, E., Evans, L.: Corner Polyhedra and their connection with cutting planes. Mathematical Programming 96, 321–339 (2003)
ILOG Cplex 9.0: User’s Manual and Reference Manual, ILOG, S.A. (2004), http://www.ilog.com/
ILOG Concert Technology 2.0: User’s Manual and Reference Manual, ILOG, S.A. (2004), http://www.ilog.com/
Letchford, A.N., Lodi, A.: Strengthening Chvàtal-Gomory cuts and Gomory fractional cuts. Operations Research Letters 30(2), 74–82 (2002)
Koppe, M., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Extended Formulations for Gomory Corner Polyhedra. Discrete Optimization Discrete Optimization 1, 141–165 (2004)
MIPLIB - Mixed Integer Problem Library 2003 (2003), http://miplib.zib.de
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischetti, M., Saturni, C. (2005). Mixed-Integer Cuts from Cyclic Groups. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_1
Download citation
DOI: https://doi.org/10.1007/11496915_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)