A PTAS for Capacitated Vehicle Routing on Trees
Claire Mathieu, Hang Zhou
TL;DR
This paper presents a polynomial time approximation scheme (PTAS) for solving the capacitated vehicle routing problem on trees, effectively handling the entire capacity range and extending to splittable variants.
Contribution
It introduces a PTAS for the CVRP on trees, covering all capacities and including splittable cases, advancing approximation algorithms in vehicle routing.
Findings
Provides a PTAS for CVRP on trees.
Extends the approach to splittable CVRP.
Achieves approximation within any desired factor.
Abstract
We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result extends to the splittable CVRP.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicular Ad Hoc Networks (VANETs) · Graph Theory and Algorithms · Data Management and Algorithms