Welcome to what is currently one of the only available open-source solvers for mixed integer programming (MIP) that applies a comprehensive and expandable Branch-Price-and-Cut framework. By making use of detection algorithms, GCG is able to apply Dantzig-Wolfe reformulation and Benders decomposition to solve (potentially) structured MIPs faster. It builds upon SCIP and thus allows for total control of the solution process and the access of detailed information down to the guts of the solver.
Further information and resources are available through the official website at gcg.or.rwth-aachen.de:
- online documentation of the code with information on how to get started,
- downloads of the released GCG source code versions,
- papers that use GCG or explain algorithms implemented in GCG,
- information on how to cite GCG when you use it in scientific publications,
- and much more!
For installation instructions have a look here or in the online documentation.