By Hans Mittelmann (mittelmann at asu.edu)
See this graphical tool for visualization of most of the results including a virtual best (ensemble)
Concorde-TSP with different LP solvers (3-3-2023)
LPfeas Benchmark (find a PD feasible point) (11-30-2023)
LPopt Benchmark (find optimal basic solution) (12-5-2023)
Large Network-LP Benchmark (commercial vs free) (12-4-2023)
MILP Benchmark - MIPLIB2017 (12-7-2023)
MILP cases that are slightly pathological (12-8-2023)
Infeasibility Detection for MILP Problems (12-6-2023)
SQL problems from the 7th DIMACS Challenge (8-8-2002)
Several SDP codes on sparse and other SDP problems (9-28-2023)
Infeasible SDP Benchmark (8-24-2023)
Large SOCP Benchmark (11-30-2023)
AMPL-NLP Benchmark (1-18-2022)
Non-commercial convex QP Benchmark (9-16-2021)
Non-Convex QUBO-QPLIB Benchmark (11-30-2023)
Binary Non-Convex QPLIB Benchmark (12-1-2023)
Discrete Non-Convex QPLIB Benchmark (non-binary) (12-6-2023)
Continuous Non-Convex QPLIB Benchmark (12-5-2023)
Convex Continuous QPLIB Benchmark (ext) (12-9-2023)
Convex Discrete QPLIB Benchmark (11-30-2023)