By Hans Mittelmann (mittelmann at asu.edu)
Note that on top of the benchmarks a link to logfiles is given!
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) (10-28-2024)
LPopt Benchmark (find optimal basic solution) (10-28-2024)
Large Network-LP Benchmark (commercial vs free) (10-28-2024)
MILP Benchmark - MIPLIB2017 (11-5-24)
MILP cases that are slightly pathological (11-1-2024)
Infeasibility Detection for MILP Problems (10-28-2024)
SQL problems from the 7th DIMACS Challenge (8-8-2002)
Several SDP codes on sparse and other SDP problems (10-30-2024)
Infeasible SDP Benchmark (8-24-2023)
Large SOCP Benchmark (10-31-2024)
AMPL-NLP Benchmark (10-28-2024)
Non-commercial convex QP Benchmark (9-16-2021)
Non-Convex QUBO-QPLIB Benchmark (10-9-2024)
Binary Non-Convex QPLIB Benchmark (11-7-2024)
Discrete Non-Convex QPLIB Benchmark (non-binary) (11-5-2024)
Continuous Non-Convex QPLIB Benchmark (11-3-2024)
Convex Continuous QPLIB Benchmark (extended) (10-28-2024)
Convex Discrete QPLIB Benchmark (11-8-2024)