**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 temporarily remove those of Gurobi as well. CPLEX was in fifteen of the benchmarks, Gurobi and XPRESS in thirteen. See here for more details. In late November 2019 selected benchmarks for Gurobi were added.

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

**
See this graphical tool for visualization of the results including a virtual best (ensemble)
**

* Concorde-TSP with different LP solvers (3-3-2023)*

* LPfeas Benchmark (find a PD feasible point) (2-8-2024)*

* LPopt Benchmark (find optimal basic solution) (2-8-2024)*

* Large Network-LP Benchmark (commercial vs free) (2-6-2024)*

* MILP Benchmark - MIPLIB2017 (2-7-2024)*

* MILP cases that are slightly pathological (2-5-2024)*

* Infeasibility Detection for MILP Problems (2-29-2024)*

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

* Several SDP codes on sparse and other SDP problems (2-8-2024)*

* Infeasible SDP Benchmark (8-24-2023)*

* Large SOCP Benchmark (2-7-2024)*

* Non-commercial convex QP Benchmark (9-16-2021)*

* Non-Convex QUBO-QPLIB Benchmark (2-10-2024)*

* Binary Non-Convex QPLIB Benchmark (2-11-2024)*

* Discrete Non-Convex QPLIB Benchmark (non-binary) (2-22-2024)*

* Continuous Non-Convex QPLIB Benchmark (2-22-2024)*

* Convex Continuous QPLIB Benchmark (ext) (2-7-2024)*

* Convex Discrete QPLIB Benchmark (2-11-2024)*