A PTAS for Capacitated Vehicle Routing on Trees

11/05/2021
by   Claire Mathieu, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset