Abstract
Primal heuristics are an important component of state-of-the-art codes for mixed integer programming. In this paper, we focus on primal heuristics that only employ computationally inexpensive procedures such as rounding and logical deductions (propagation). We give an overview of eight different approaches. To assess the impact of these primal heuristics on the ability to find feasible solutions, in particular early during search, we introduce a new performance measure, the primal integral. Computational experiments evaluate this and other measures on MIPLIB 2010 benchmark instances.
Supported by the DFG Research Center MATHEON Mathematics for key technologies in Berlin
This is a preview of subscription content, log in via an institution to check access.
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
T. Achterberg. Constraint Integer Programming. PhD thesis, Technische Universität Berlin, 2007.
T. Achterberg, T. Berthold, and G. Hendel. Rounding and propagation heuristics for mixed integer programming. ZIB-Report 11-29, Zuse Institute Berlin, 2011. http://vs24.kobv.de/opus4-zib/frontdoor/index/index/docId/1325/.
T. Berthold. Primal Heuristics for Mixed Integer Programs. Master’s thesis, Technische Universität Berlin, 2006.
G. Hendel. New rounding and propagation heuristics for mixed integer programming. Bachelor’s thesis, Technische Universität Berlin, 2011.
T. Koch, T. Achterberg, E. Andersen, O. Bastert, T. Berthold, R. E. Bixby, E. Danna, G. Gamrath, A. M. Gleixner, S. Heinz, A. Lodi, H. Mittelmann, T. Ralphs, D. Salvagnin, D. E. Steffy, and K. Wolter. MIPLIB 2010. Mathematical Programming Computation, 3(2):103–163, 2011.
C. Wallace. ZI round, a MIP rounding heuristic. Journal of Heuristics, 16:715–722, 2009.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Achterberg, T., Berthold, T., Hendel, G. (2012). Rounding and Propagation Heuristics for Mixed Integer Programming. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)