Two-Stage Learned Decomposition for Scalable Routing on Multigraphs.

arXiv:2605.05389v2 Announce Type: replace-cross Abstract: Most neural methods for Vehicle Routing Problems (VRPs) are limited to Euclidean settings or simple graphs. In this work, we instead consider multigraphs, where parallel edges represent distinct travel