Lazy BPRC finds optimal solutions for MT-VRP-O up to 10x faster than ablations by deferring exact motion planning costs via relaxed-continuity lower bounds in branch-and-price.
Exact branch-price-and- cut algorithms for vehicle routing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price
Lazy BPRC finds optimal solutions for MT-VRP-O up to 10x faster than ablations by deferring exact motion planning costs via relaxed-continuity lower bounds in branch-and-price.