| Stable release | 2.1.0 |
|---|---|
| Development status | Active |
| Written in | C |
| Operating system | Cross-platform |
| Type | Mathematical optimization |
| Website | homepage |
SCIP (optimization software) is a mixed integer programming solver and a framework for Branch and cut and Branch and price, developed at Zuse Institute Berlin. SCIP stands for Solving Constraint Integer Programs. It is based on the Branch and bound algorithm with LP relaxations.
The design of SCIP is based on the notion of constraints. It supports about 20 constraint types for mixed-integer linear programming, mixed-integer all-quadratic programming and Pseudo-Boolean [1] optimization. There are also some global CP constraints available.
SCIP is implemented as C callable library. For user plugins, C++ wrapper classes are provided. The solver for the LP relaxations is not a native component of SCIP, an open LP interface is provided instead. Currently supported LP solvers are CLP, CPLEX, Gurobi, Mosek, QSopt, SoPlex, and Xpress. SCIP can be run on Linux, Mac, Sun, and Windows operating systems.
Run as a standalone solver, it is one of the fastest non-commercial solvers for mixed integer programs.[2] SCIP can be accessed through the modeling system of GAMS.