The NEOS Server offers SCIP for the solution of mixed-integer second order cone problems in CPLEX extended MPS or in CPLEX LP format.
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 a number of LP solvers and with the nonlinear solver IPOPT. See these benchmarks for the relative performance of SCIP.
Source and documentation are available from the SCIP Homepage
The SCIP developers are listed here,
This solver was implemented by Hans Mittelmann and executes in 64-bit at
The administrator of SCIP reserves the right to keep and use problem instances submitted through NEOS for testing and debugging purposes.