Primal Heuristics for Branch-and-Price Algorithms
by
Marco Lübbecke
,
Christian Puchert
| Citations: | 1 - 1 self |
BibTeX
@MISC{Lübbecke_primalheuristics,
author = {Marco Lübbecke and Christian Puchert},
title = {Primal Heuristics for Branch-and-Price Algorithms},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG based on the SCIP framework. This involves new heuristics as well as heuristics from the literature that make use of the reformulation yielded by the Dantzig-Wolfe decomposition. We give short descriptions of those heuristics and briefly discuss computational results. Furthermore, we give an outlook on current and further development. 1
Citations
| 175 | Decomposition principle for linear programs - Dantzig, Wolfe - 1960 |
| 25 | A primer in column generation - Desrosiers, Lübbecke |
| 24 | SCIP: solving constraint integer programs - Achterberg |
| 20 | The feasibility pump - Fischetti, Glover, et al. |
| 8 | Primal Heuristics for Mixed Integer Programs - Berthold - 2006 |
| 6 | Experiments with a generic Dantzig-Wolfe decomposition for integer programs - Gamrath, Lübbecke - 2010 |
| 5 | Partial convexification of general MIPs by Dantzig-Wolfe reformulation - Bergner, Caprara, et al. - 2011 |
| 4 | An evolutionary algorithm for polishing mixed integer programming solutions - ROTHBERG |
| 3 | F.: Column generation based primal heuristics - Joncour, Michel, et al. - 2012 |
| 2 | A.: Miplib 2003 - Achterberg, Koch, et al. - 2006 |
