The NEOS Server offers SCIP for the solution of mixed-integer linear programming problems in AMPL 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
Only a model and a datafile may be submitted no command file. Neither model nor data file may contain commands. Note: Do not use an "end" at the end of the model file! Note: Problems must be formulated as minimization problems (maximize obj -> minimize (-obj), then obj -> -obj)! If non-standard SCIP parameter settings are required, the user may also submit changes from this default parameter file. Only the line(s) in which a parameter is changed from default should be submitted such as limits/solutions = 1 if SCIP should stop when the first feasible solution has been found. 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 AMPL model file (linear, minimization; no commands, no "end") AMPL model:
DOE disclaimer DOE Web privacy policy