By Hans Mittelmann (mittelmann at asu.edu)
See this graphical tool for visualization of the results
Concorde-TSP with different LP solvers (12-11-2019)
Benchmark of Simplex LP solvers (3-3-2021)
Benchmark of Barrier LP solvers (3-3-2021)
Large Network-LP Benchmark (commercial vs free) (3-3-2021)
MILP Benchmark - MIPLIB2017 (2-5-2021)
MILP cases that are slightly pathological (1-28-2021)
SQL problems from the 7th DIMACS Challenge (8-8-2002)
Several SDP codes on sparse and other SDP problems (6-6-2020)
Infeasible SDP Benchmark (10-12-2020)
Large SOCP Benchmark (12-12-2020)
AMPL-NLP Benchmark (12-10-2020)
Non-commercial convex QP Benchmark (11-1-2019)
Binary Non-Convex QPLIB Benchmark (1-25-2021)
Discrete Non-Convex QPLIB Benchmark (non-binary) (1-27-2021)
Continuous Non-Convex QPLIB Benchmark (1-23-2020)
Convex Continuous QPLIB Benchmark (12-13-2020)
Convex Discrete QPLIB Benchmark (1-23-2020)