GCG is a generic branch-cut-and-price solver for mixed integer programs. It is based on the branch-and-cut-and-price framework SCIP and is also part of the SCIP Optimization Suite. After the standard presolving process of SCIP, GCG performs a Dantzig-Wolfe decomposition of the problem to obtain an extended formulation of the problem. The decomposition is based on a structure either provided by the user or automatically detected by one of the structure detectors included in GCG. During the solving process, GCG manages two SCIP instances, one holding the original problem, the other one representing the reformulated problem. The original instance coordinates the solving process while the other one builds the tree in the same way, transfers branching decisions and bound changes from the original problem and solves the LP relaxation of the extended formulation via column generation. GCG is developed jointly by RWTH Aachen and Zuse-Institute Berlin and has more than 50,000 lines of C code.

References in zbMATH (referenced in 23 articles )

Showing results 21 to 23 of 23.
Sorted by year (citations)
  1. Lübbecke, Marco; Puchert, Christian: Primal heuristics for branch-and-price algorithms (2012)
  2. Bergner, Martin; Caprara, Alberto; Furini, Fabio; Lübbecke, Marco E.; Malaguti, Enrico; Traversi, Emiliano: Partial convexification of general mips by Dantzig-Wolfe reformulation (2011)
  3. Gamrath, Gerald; Lübbecke, Marco E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs (2010) ioport