NEPF decomposes routing policies into node permutation and edge selection stages for scalable solving of multigraph VRPs, achieving competitive quality with faster training and inference.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Two-Stage Learned Decomposition for Scalable Routing on Multigraphs
NEPF decomposes routing policies into node permutation and edge selection stages for scalable solving of multigraph VRPs, achieving competitive quality with faster training and inference.