SCIP
Solving Constraint Integer Programs
Konrad-Zuse-Zentrum für Informationstechnik Berlin
Division Scientific Computing
Department Optimization
Goto ZIB

SCIP is currently one of the fastest non-commercial mixed integer programming (MIP) solvers. It is also a framework for Constraint Integer Programming and branch-cut-and-price. It allows total control of the solution process and the access of detailed information down to the guts of the solver.


Comparison to other MIP solvers

MIP solver benchmark (1 thread): Geometric mean of results taken from the homepage of Hans Mittelmann (9/Jan/2012). Unsolved or failed instances are accounted for with the time limit of 1 hour.

Recent News

28/Dec/2011 SCIP version 2.1.1 released (bug fix release, see Release Notes and CHANGELOG).
The ZIB Optimization Suite 2.1.1 consists of SCIP 2.1.1, SoPlex 1.6.0, and ZIMPL 3.2.0.
31/Oct/2011 SCIP version 2.1.0 released (see Release Notes and CHANGELOG).
The ZIB Optimization Suite 2.1.0 consists of SCIP 2.1.0, SoPlex 1.6.0, and ZIMPL 3.2.0.
26/Aug/2011 SCIP version 2.0.2 released (see Release Notes and CHANGELOG).

More news ...


Cooperation

SCIP is developed in cooperation with The development of SCIP is supported by the DFG Research Center Matheon, in particular within Project B20.
Valid HTML 4.01
© 2003-2012 by Zuse Institute Berlin (ZIB), Imprint Last Update Friday, 13-April-2012 06:18:53 PM CEST