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

DOI10.1007/978-3-540-77903-2_5zbMath1209.90356MaRDI QIDQ5391872

Timo Berthold

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_5

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C59: Approximation methods and heuristics in mathematical programming

90-04: Software, source code, etc. for problems pertaining to operations research and mathematical programming

Related Items

Constraint Integer Programming: A New Approach to Integrate CP and MIP, SCIP

Uses Software

• MIPLIB
• Benchmarks for Optimization Software
• FEASPUMP