**By Hans Mittelmann (mittelmann at asu.edu)**

For many years our benchmarking effort had included the solvers CPLEX, Gurobi, and XPRESS. Through an action by Gurobi at the 2018 INFORMS Annual Meeting this has come to an end. IBM and FICO demanded that results for their solvers be removed and then we decided to remove those of Gurobi as well.

A partial record of previous benchmarks can be obtained from this webpage and some additional older benchmarks

* Concorde-TSP with different LP solvers (12-20-2017)*

* Benchmark of Simplex LP solvers (1-5-2019)*

* Benchmark of Barrier LP solvers (12-23-2018)*

* Large Network-LP Benchmark (commercial vs free) (12-23-2018)*

* MILP Benchmark - MIPLIB2017 (1-15-2019)*

* MILP cases that are slightly pathological (1-17-2019)*

* SQL problems from the 7th DIMACS Challenge (8-8-2002)*

* Several SDP codes on sparse and other SDP problems (10-25-2018)*

* Infeasible SDP Benchmark (5-9-2018)*

* AMPL-NLP Benchmark (12-23-2018)*

* Non-commercial convex QP Benchmark (11-16-2018)*

* Binary QPLIB Benchmark (12-23-2018)*

* QPLIB-QCQP Benchmark (12-28-2018)*

* Convex Discrete QPLIB Benchmark (12-28-2018)*