SCIP (Solving Constraint Integer Programs) is a framework for constraint integer programming oriented towards the needs of mathematical programming experts who want to have total control of the solution process and access detailed information down to the guts of the solver. It integrates techniques from mixed integer programming, constraint programming, and SAT solving. It can also be used as a pure MIP solver or as a framework for branch-cut-and-price. In order to use it, you have to link to an LP solver. It currently supports CLP, CPLEX, Mosek, Soplex, and XPress-MP. License: Free for non-commercial use Changes:
New constraint handlers for SOS constraints. Better support for compilation of projects using SCIP. SCIP can now count integer solutions. A column generation example for graph coloring has been added. Extended output capabilities. Support for Pseudo-Boolean problems. New heuristic DINS. New cutting plane separator MCF. Improved sorting functions. Revised preprocessing. Reworked timing calls. LP-interfaces adapted to Clp and SoPlex. Many internal performance improvements and bugfixes.