24 Mar 2014 ========================================= Infeasibility Detection for MILP Problems ========================================= H. Mittelmann (mittelmann@asu.edu)

The following codes were run on the infeasible problems from MIPLIB2010 with the MIPLIB2010 scripts on an Intel Xeon X5680 (32GB, Linux, 64 bits, 2*6 cores).

CPLEX-12.6.0: CPLEX
GUROBI-5.6.0: GUROBI
ug[SCIP/spx/cpx]-3.1.0: Parallel development version of SCIP
CBC-2.8.7: CBC
XPRESS-7.7.0: XPRESS

Table for 12 threads, Result files per solver, Log files per solver

Statistics of the problems can be obtained from the MIPLIB2010 webpage.

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Shifted geometric means of times

All non-successes are counted as max-time (1 hr). The fastest solver is scaled to 1.


              CBC      CPLEX      FSCIPC     FSCIPS     GUROBI     XPRESS
--------------------------------------------------------------------------
             61.4        1         34.5       42.4        1         2.44
--------------------------------------------------------------------------
solved of 19:  8        18           9         10         18         18
--------------------------------------------------------------------------