By Hans Mittelmann (mittelmann at asu.edu)
See this graphical tool for visualization of the results including a virtual best (ensemble)
Concorde-TSP with different LP solvers (5-2-2022)
Benchmark of Simplex LP solvers (7-31-2022)
Benchmark of Barrier LP solvers (7-29-2022)
Large Network-LP Benchmark (commercial vs free) (6-16-2022)
MILP Benchmark - MIPLIB2017 (6-30-2022)
MILP cases that are slightly pathological (7-25-2022)
Infeasibility Detection for MILP Problems (7-24-2022)
SQL problems from the 7th DIMACS Challenge (8-8-2002)
Several SDP codes on sparse and other SDP problems (7-27-2022)
Infeasible SDP Benchmark (6-18-2022)
Large SOCP Benchmark (6-19-2022)
AMPL-NLP Benchmark (1-18-2022)
Non-commercial convex QP Benchmark (9-16-2021)
Binary Non-Convex QPLIB Benchmark (7-23-2022)
Discrete Non-Convex QPLIB Benchmark (non-binary) (7-16-2022)
Continuous Non-Convex QPLIB Benchmark (7-21-2022)
Convex Continuous QPLIB Benchmark (7-26-2022)
Convex Discrete QPLIB Benchmark (8-12-2022)