Primal Heuristics for Branch-and-Price Algorithms

DOI10.1007/978-3-642-29210-1_11zbMath1306.90181OpenAlexW171354412MaRDI QIDQ5176283

Marco E. Lübbecke, Christian Puchert

Publication date: 3 March 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_11

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Integral Column Generation for Set Partitioning Problems with Side Constraints ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods

Uses Software

• SCIP
• MIPLIB2003
• GCG

Cites Work

• SCIP: solving constraint integer programs
• MIPLIB 2003
• The feasibility pump
• Column Generation based Primal Heuristics
• An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
• Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
• Decomposition Principle for Linear Programs
• A Primer in Column Generation

This page was built for publication: Primal Heuristics for Branch-and-Price Algorithms