|
SCIP
Solving Constraint
Integer Programs
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.
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
CooperationSCIP is developed in cooperation with
|
|||||||
|
|
|