Weighted MaxSAT on a GH200: From 14/33/50 to 33/38/26 Against NuWLS-c-IBR
GPU Local Search, a SAT-Based Improver and a Native Local Search Racing Together. 97 MaxSAT-Evaluation Instances at 60 s; Held-Out 59: 22/34/3.
33/38/26wins / ties / losses vs NuWLS-c-IBR, 97 instances
22/34/3on the 59 held-out instances
−36 → +7net wins minus losses, first build to 1.0.2
35/59/3SAT-based LNS vs the previous default
- 1.0.2 vs NuWLS-c-IBR: 33/38/26 on 97; held-out 59 22/34/3; 93 vs 93 feasible
- SAT-based LNS vs the previous default: 35/59/3 (held-out 10/47/2)
- Still behind on the 38 design instances (11/4/23)
More garmo solvers benchmark results
- Proof-Carrying Max-Cut on a GH200: 67 Biq Mac Optima Proved vs HiGHS's 49
- 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
- UNISOLVE 0.16.1: One Solver Platform, 13 Problem Domains, Every Answer Checked
- Four Certified Builds: Toroidal Proofs, Unroutability Certificates, CertBQP and a 235× Batch Service