Experimental Algorithms

Volume 6049 of the series Lecture Notes in Computer Science pp 239-252

Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs

  • Gerald GamrathAffiliated withZuse Institute Berlin
  • , Marco E. LübbeckeAffiliated withFachbereich Mathematik, Technische Universität Darmstadt

* Final gross prices may vary according to local VAT.

Get Access


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.