scip

The NEOS Server offers SCIP for the solution of mixed-integer linear programming problems in MPS format, in CPLEX-LP format, or in ZIMPL format. See these notes on formats and conversion.

SCIP 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. SCIP can also be used as pure MIP solver or as framework for branch-cut-and-price.

SCIP can be linked with CPLEX, XPRESS-MP, MOSEK, Soplex, or COIN-Clp as LP solvers. See this benchmark for the relative performance of SCIP.

Source and documentation are available from the SCIP Homepage

SCIP was developed by Tobias Achterberg,

This solver was implemented by Hans Mittelmann and executes in 64-bit at

Using the NEOS Server for SCIP

The user must submit a mixed-integer linear programming problem in one of the formats given above. If non-standard parameter settings are required, the user may also submit changes from this default parameter file. Only the line(s) should be submitted in which a parameter is changed from default such as limits/solutions = 1 if SCIP should stop when the first feasible solution has been found (only with full presolve). When submitting via e-mail or XML-RPC delete empty tokens!

The administrator of SCIP reserves the right to keep and use problem instances submitted through NEOS for testing and debugging purposes.

Enter the complete path to the MPS format data file
SCIP data (MPS format file):

Alternatively, enter the complete path to the CPLEX-LP file
SCIP data (CPLEX-LP format file):

Alternatively, enter the complete path to the ZIMPL file
SCIP data (ZIMPL format file):

Enter the complete path to the parameter file
Parameter file (optional):

Choose the LP solver (CPLEX(short presolve)=cpx0, CPLEX=cpx, SOPLEX=spx)
LP solver:

Comments:

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}