9 Dec 2011      =========================================
                 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.4.0.0: CPLEX
GUROBI-4.6.1: GUROBI
ug[SCIP/spx/cpx]: Parallel development version of SCIP
CBC-2.7.4: CBC
XPRESS-7.2.1: XPRESS

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

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

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Geometric means of times

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


              CBC      CPLEX      FSCIPC     FSCIPS     GUROBI     XPRESS
--------------------------------------------------------------------------
             48.0      1.52        21.8       28.1       1.00       4.30
--------------------------------------------------------------------------
solved of 19:  6        16          12         14         18         15
-----------------------------------------------------------------------