A harness for AI agents enabled construction of a Rust library with 100+ problem types and 200+ reduction rules for NP-hard problems in three months.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.AI 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The b-LAHC algorithm sets 9/10 new best-known results on large-scale E-CVRP benchmarks by using a surrogate-guided bilevel framework with fixed parameters.
citing papers explorer
-
Problem Reductions at Scale: Agentic Integration of Computationally Hard Problems
A harness for AI agents enabled construction of a Rust library with 100+ problem types and 200+ reduction rules for NP-hard problems in three months.
-
Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem
The b-LAHC algorithm sets 9/10 new best-known results on large-scale E-CVRP benchmarks by using a surrogate-guided bilevel framework with fixed parameters.