[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-sat-solvers-beat-gurobi-at-a-wonky-graph-labeling-problem":10,"sections":35},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},6803,"sat-solvers-beat-gurobi-at-a-wonky-graph-labeling-problem","SAT Solvers Beat Gurobi at a Wonky Graph Labeling Problem","A new SAT-based method for a niche graph-labeling puzzle outperforms commercial solvers like Gurobi and CPLEX, showing exact methods still have room to win.","New research shows that open Boolean satisfiability (SAT) solvers can out-compute two of the biggest names in commercial optimization software on a classic graph-labeling puzzle.\n\nAntibandwidth problems ask you to number the nodes of a graph so that connected nodes get labels as far apart in value as possible. Most prior work chased that \"maximize the gap\" version. This paper flips it: fix how far apart connected labels must be, then find the smallest range of numbers needed to pull it off. The authors call this the Minimum Span Antibandwidth problem, plus a cyclic variant, and solve both with a SAT-based framework that works through a sequence of decision problems, either checking several candidate ranges at once or narrowing one search step by step. Tested on benchmark matrices from the Harwell-Boeing collection, the SAT methods matched or beat CPLEX and Gurobi - the default commercial tools for this kind of optimization - and won outright on the cyclic version.\n\nThat result matters beyond the math department. CPLEX and Gurobi are the go-to engines for hard scheduling, layout, and resource-allocation problems across engineering and logistics, and they aren't free. Watching a SAT-based approach - built on much older, more accessible logic techniques - hold its own or win against them suggests exact optimization still has room for cheaper alternatives to catch up.\n\nDon't expect this in a product roadmap. It's a benchmark study on a fairly obscure labeling problem, and the practical payoff, if any, is years out.","[\"algorithms\",\"sat-solvers\",\"optimization\",\"graph-theory\"]","2026-09-18T04:00:00.000Z","2026-09-18T17:25:36.066Z","2026-09-18T17:25:47.935Z","published",null,[],"science",[26,27,28,29],"algorithms","sat-solvers","optimization","graph-theory",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.20091",0,{"sections":36},[37,41,45,50,55,59,62,67,71,76,81,86,91,96],{"name":38,"slug":39,"count":40,"latest_published_at":18},"AI","ai",4016,{"name":42,"slug":43,"count":44,"latest_published_at":18},"Security","security",653,{"name":46,"slug":47,"count":48,"latest_published_at":49},"Policy","policy",338,"2026-09-11T04:00:00.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":18},"Hardware","hardware",155,{"name":60,"slug":24,"count":61,"latest_published_at":18},"Science",121,{"name":63,"slug":64,"count":65,"latest_published_at":66},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":68,"slug":69,"count":70,"latest_published_at":18},"Dev Tools","dev-tools",77,{"name":72,"slug":73,"count":74,"latest_published_at":75},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":77,"slug":78,"count":79,"latest_published_at":80},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":82,"slug":83,"count":84,"latest_published_at":85},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":87,"slug":88,"count":89,"latest_published_at":90},"General","general",41,"2026-09-08T01:57:23.000Z",{"name":92,"slug":93,"count":94,"latest_published_at":95},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":97,"slug":98,"count":99,"latest_published_at":100},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]