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

DOI10.1007/978-3-540-77903-2_5zbMath1209.90356OpenAlexW2157072141MaRDI 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

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Recursive central rounding for mixed integer programs, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Shift-and-propagate, ZI round, a MIP rounding heuristic, RENS. The optimal rounding, SCIP, Solving robust bin-packing problems with a branch-and-price approach, Decomposition, reformulation, and diving in university course timetabling, Conflict-Driven Heuristics for Mixed Integer Programming

Uses Software

• MIPLIB
• Benchmarks for Optimization Software
• FEASPUMP

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• MIPLIB 2003
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump