We report on experiments with turning the branch-price-and-cut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our code performs a Dantzig-Wolfe decomposition according to the user's specification, and solves the resulting re-formulation via branch-and-price.We take care of the column generation subproblems which are solved as MIPs themselves, branch and cut on the original variables (when this is appropriate), aggregate identical subproblems, etc. The charm of building on a well-maintained framework lies in avoiding to re-implement state-of-the-art MIP solving features like pseudo-cost branching, preprocessing, domain propagation, primal heuristics, cutting plane separation etc. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Gamrath, G., & Lübbecke, M. E. (2010). Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6049 LNCS, pp. 239–252). https://doi.org/10.1007/978-3-642-13193-6_21
Mendeley helps you to discover research relevant for your work.