Abstract
Cutting planes for mixed integer problems (MIP) are nowadays an integral part of all general purpose software to solve MIP. The most prominent,and computationally significant, class of general cutting planes are Gomory mixed integer cuts (GMI). However finding other classes of general cuts for MIP that work well in practice has been elusive. Recent advances on the understanding of valid inequalities derived from the infinite relaxation introduced by Gomory and Johnson for mixed integer problems, has opened a new possibility of finding such an extension. In this paper, we investigate the computational impact of using a subclass of minimal valid inequalities from the infinite relaxation, using different number of tableau rows simultaneously, based on a simple separation procedure. We test these ideas on a set of MIPs, including MIPLIB 3.0 and MIPLIB 2003, and show that they can improve MIP performance even when compared against commercial software performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Op. Res. Letters 33, 42–54 (2005)
Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters 34(4), 361–372 (2006)
Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 1–15. Springer, Heidelberg (2007)
Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: A test set of mixed integer programming problems. SIAM News 25(16) (1992)
Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice - closing the gap. In: Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization, Deventer, The Netherlands, pp. 19–50. Kluwer, B.V., Dordrecht (2000)
Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Prog. 47, 155–174 (1990)
Cornuéjols, G., Borozan, V.: Minimal valid inequalities for integer constraints. In: George Nemhauser Symposium, Atlanta (July 2007)
Cornuéjols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. Tepper Working Paper 2007 E-35 (2007)
Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, RAND Corporation (1960)
Gomory, R.E.: Corner polyhedra and two-equation cutting planes. In: George Nemhauser Symposium, Atlanta (July 2007)
Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra, part I. Math. Prog. 3, 23–85 (1972)
ILOG CPLEX Division, Incline Village, Nevada, 89451, USA. CPLEX 10.2 Reference Manual (2007)
Knuth, D.E.: The Art of Computer Programming. Ch. 7.2.1.1, 1st edn., vol. 4. Addison-Wesley, Reading (2005)
Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. on Computing 11, 173–187 (1999)
Lovász, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developments and Applications, pp. 177–210. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Espinoza, D.G. (2008). Computing with Multi-row Gomory Cuts. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)