Abstract
Mixed-Integer Programs (MIP’s) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and analyze computationally an automatic problem reformulation of quite general applicability, aimed at removing the model dependency on the big-M coefficients. Our solution scheme defines a master Integer Linear Problem (ILP) with no continuous variables, which contains combinatorial information on the integer-variable feasible combinations that can be “distilled” from the original MIP model. The master solutions are sent to a slave Linear Program (LP), which validates them and possibly returns combinatorial inequalities to be added to the current master ILP. The inequalities are associated to minimal (or irreducible) infeasible subsystems of a certain linear system, and can be separated efficiently in case the master solution is integer. This produces an LP relaxation of the master problem which can be considerably tighter than the one associated with original MIP formulation. Computational results on two specific classes of hard-to-solve MIP’s indicate the new method produces a reformulation which can be solved some orders of magnitude faster than the original MIP model.
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
Amaldi, E., Pfetsch, M.E., Trotter, L.E.: On the Maximum Feasible Subsystem Problem, IISs and IIS-Hypergraphs. Mathematical Programming 95(3), 533–554 (2003)
Andreello, G., Caprara, A., Fischetti, M.: Embedding Cuts within a Branch & Cut Framework: a Computational Study with {0, 1 2 }-cuts., Technical Report, DEI, University of Padova (2003)
Benders, J.F.: Partitioning Procedures for Solving Mixed Variables Programming Problems. Numerische Mathematik 4, 238–252 (1962)
Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and Practice—Closing the Gap, available at http://www.ilog.com/products/optimization/tech/research/mip.pdf
Caprara, A., Fischetti, M.: {0, 1 2}- Chvátal-Gomory Cuts. Mathematical Programming 74, 221–235 (1996)
Chinneck, J.: Fast Heuristics for the Maximum Feasible Subsystem Problem. INFORMS J. Comput. 13(3), 210–223 (2001)
Chvátal, V.: Resolution Search. Discrete Applied Mathematis 73, 81–99 (1997)
Codato, G.: A Combinatorial Approach to Benders’ Decomposition. Tesi di Laurea, University of Padova (2003) (in italian)
Codato, G., Fischetti, M.: Combinatorial Benders’ Cuts, full paper, available at http://www.dei.unip.it/~fisch/cbc.pdf
Gleesonand, J., Ryan, J.: Identifying Minimally Infeasible Subsystems of Inequalities. ORSA Journal on Computing 2(1), 61–63 (1990)
Glover, F., Tangedhal, L.: Dynamic Strategies for Branch and Bound. Omega 4(5), 571–576 (1976)
Hooker, J.N., Ottosson, G.: Logic-based Benders Decomposition. Mathematical Programming, Mathematical Programming 96, 33–60 (2003)
ILOG Cplex 8.1: User’s Manual and Reference Manual, ILOG, S.A (2003), http://www.ilog.com/
ILOG Concert Technology 1.2: User’s Manual and Reference Manual, ILOG, S.A (2003), http://www.ilog.com/
Klau, G.W., Mützel, P.: Optimal Labelling of Point Features in Rectangular Labelling Models. Mathematical Programming Ser. B 94(2-3), 435–458 (2003)
Parker, M., Ryan, J.: Finding the Minimum Weight IIS Cover of an Infeasible System of Linear Inequalities. Ann. Math. Artificial Intelligence 17, 107–126 (1996)
Rubin, P.A.: Solving Mixed Integer Classification Problem by Decomposition. Annals of Operations Research 74, 51–64 (1997)
Thorsteinsson, E.S.: Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 16. Springer, Heidelberg (2001)
Murphy, P.M., Aha, D.W.: UCI Repository of Machine Learning Databases. University of California, Department of Information and Computer Science, Irvine, CA (1994), available at http://www.ics.uci.edu/~mlearn/MLRepository.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codato, G., Fischetti, M. (2004). Combinatorial Benders’ Cuts. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive