UNISOLVE 0.16.1: One Solver Platform, 13 Problem Domains, Every Answer Checked
106 CUDA Gauntlet Cases Passed on One GH200; 8 Real Application Models Answered and Checked; One Airline Optimum Proved Exactly.
106/106CUDA gauntlet cases passed (one GH200)
14,207tests passed on Brev (13 skipped)
8/8real application models answered and checked
gap 0flugpl airline optimum 1,201,500 proved exactly
- Gauntlet: 106/106 passed; peak memory grows linearly (exponent 0.999–1.002)
- Real-world: 8/8 feasible and checked; 3 independently re-checked; flugpl 1,201,500 proved optimal (gap 0)
- Capacity case: 30 M vertices, 90 M edges, 4.2 GB peak, resident median 0.014 s
More garmo solvers benchmark results
- Proof-Carrying Max-Cut on a GH200: 67 Biq Mac Optima Proved vs HiGHS's 49
- Weighted MaxSAT on a GH200: From 14/33/50 to 33/38/26 Against NuWLS-c-IBR
- Large-Instance TSP on 16 Arm Cores: 0.692 % → 0.165 % Mean Gap, Still Behind LKH-3
- A Native QCDCL Solver vs DepQBF: From 0 vs 4 to a 15–15 Tie, Then 15 vs 18 on Fresh Instances
- Vehicle Routing vs PyVRP: a C++ Iterated Local Search Wins 37/26/21 at Equal Budget
- ISPD98 Bisection: a Multilevel FM + Flow Engine Beats KaHyPar and mt-KaHyPar at Equal Budget
- An Evidence-Driven Solver Router: Regret 0.046 vs 0.190 for the Best Single Backend
- A Verified MIP Race: HiGHS, SCIP and GPU Primal Heuristics Against cuOpt on MIPLIB 2017
- Lazy Clause Generation in C++: 39 of 40 Schedules Proved Optimal vs CP-SAT's 20
- Certified GPU Numerics: Every Answer Carries a Checkable Certificate: and Where It Costs
- LABS on a GH200: Exponent 1.24 to the Proven Optimum, Beside the QAOA Exponents
- Four Certified Builds: Toroidal Proofs, Unroutability Certificates, CertBQP and a 235× Batch Service