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