GCG: Generic Column Generation
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.
For the purpose of submitting this package to Fedora, here is the RPM spec file.