Heuristics of the Branch-Cut-and-Price-Framework SCIP
Please always quote using this URN: urn:nbn:de:0297-zib-10280
- 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.
Author: | Timo BertholdORCiD |
---|---|
Document Type: | ZIB-Report |
Tag: | Branch and Cut; Gemischt-Ganzzahlige Programmierung; Primalheuristiken; SCIP SCIP; branch and cut; mixed integer programming; primal heuristics |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C59 Approximation methods and heuristics | |
Date of first Publication: | 2007/11/01 |
Series (Serial Number): | ZIB-Report (07-30) |
ISSN: | 1438-0064 |
ZIB-Reportnumber: | 07-30 |
Published in: | Appeared in: Operations Research Proceedings 2007, Jörg Kalcsics and Stefan Nickel (eds.) 2008, pp. 31-36 |