Heuristics of the Branch-Cut-and-Price-Framework SCIP

Timo Berthold ()
Additional contact information
Timo Berthold: Konrad-Zuse-Zentrum für Informationstechnik

A chapter in Operations Research Proceedings 2007, 2008, pp 31-36 from Springer

Abstract: 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.

Keywords: Mixed Integer Program; Large Neighborhood Search; Objective Feasibility; Feasibility Pump; Neighborhood Search Heuristic (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-77903-2_5

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_5

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().