Two-Stage Learned Decomposition for Scalable Routing on Multigraphs
概要
arXiv:2605.05389v1 Announce Type: 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 options with varying trade-offs (e.g., distance…
