A hierarchical graph-partition framework with K local two-way re-partition levels improves neural CVRP solvers at scales up to 10,000 customers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hierarchical Learning-based Graph Partition for Large-scale Vehicle Routing Problems
A hierarchical graph-partition framework with K local two-way re-partition levels improves neural CVRP solvers at scales up to 10,000 customers.