Abstract
In this paper we give an overview of the heuristics which are integrated into the open source branch-cut-and-price-framework SCIP. We briefly describe the fundamental ideas of different categories of heuristics and present some computational results which demonstrate the impact of heuristics on the overall solving process of SCIP.
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 and T. Berthold. Improving the Feasibility Pump. Discrete Optimization, Special Issue 4(1):77–86, 2007.
T. Achterberg, T. Berthold, M. Pfetsch, and K. Wolter. SCIP (Solving Constraint Integer Programs). http://scip.zib.de.
T. Achterberg, T. Koch, and A. Martin. MIPLIB 2003. Operations Research Letters, 34(4):1–12, 2006. http://miplib.zib.de.
L. Bertacco, M. Fischetti, and A. Lodi. A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization, Special Issue 4(1):77–86, 2007.
T. Berthold. Primal Heuristics for Mixed Integer Programs. Master’s thesis, Technische Universität Berlin, 2006.
T. Berthold. RENS-Relaxation Enforced Neighborhood Search. ZIB-Report 07-28, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2007. http://opus.kobv.de/zib/volltexte/2007/1053/.
R. E. Bixby, S. Ceria, C. M. McZeal, and M. W. Savelsbergh. An updated mixed integer programming library: MIPLIB 3.0. Optima, (58):12–15, 1998.
E. Danna, E. Rothberg, and C. L. Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming A, 102(1):71–90, 2004.
M. Fischetti, F. Glover, and A. Lodi. The feasibility pump. Mathematical Programming A, 104(1):91–104, 2005.
M. Fischetti and A. Lodi. Local branching. Mathematical Programming B, 98(1–3):23–47, 2003.
H. Mittelmann. Decision tree for optimization software: Benchmarks for optimization software. http://plato.asu.edu/bench.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthold, T. (2008). Heuristics of the Branch-Cut-and-Price-Framework SCIP. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77903-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77902-5
Online ISBN: 978-3-540-77903-2
eBook Packages: Business and EconomicsBusiness and Management (R0)