AI RESEARCH
Graph-Coarsening Approach for the Capacitated Vehicle Routing Problem with Time Windows
arXiv CS.AI
•
ArXi:2510.22329v2 Announce Type: replace The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is a fundamental NP-hard optimization problem in logistics. Solving large-scale instances remains computationally challenging for exact solvers. This paper