Abstract
It is well-known that sparsity (i.e. having only a few nonzero coefficients) is a desirable property for cutting planes in mixed-integer programming. We show that on the MIPLIB 2003 problem instance set, using only 10 very dense cutting planes (compared to thousands of constraints in a model), leads to a run time increase of 25 % on average for the LP-solver. We introduce the concept of dual sparsity (a property of the row-multipliers of the cut) and show a strong correlation between dual and primal (the usual) sparsity. Lift-and-project cuts crucially depend on the choice of a so-called normalization, of which we compared several known ones with respect to their actual and possible sparsity. Then a new normalization is tested that improves the dual (and hence the primal) sparsity of the generated cuts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 141 (2009)
Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Res. Lett. 34, 361–372 (2006)
Balas, E., Ceria, S., Cornuéjols, G.: A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Program. 58, 295324 (1993)
Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0–1 programming. Math. Program. 94, 221–245 (2003)
Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128, 205–230 (June 2011)
Wolter, K.: Implementation of cutting plane separators for mixed integer programs. Masters thesis (2006)
Acknowledgments
I owe many thanks to my internship advisor Laci Ladanyi in the CPLEX group at IBM as well as my university advisor Volker Kaibel. Additionally, I want to thank Andrea Lodi, Tobias Achterberg and Roland Wunderling for several stimulating discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Walter, M. (2014). Sparsity of Lift-and-Project Cutting Planes. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-00795-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00794-6
Online ISBN: 978-3-319-00795-3
eBook Packages: Business and EconomicsBusiness and Management (R0)