Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A PTAS for Capacitated Vehicle Routing on Trees

A PTAS for Capacitated Vehicle Routing on Trees 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Algorithms (TALG) Association for Computing Machinery

A PTAS for Capacitated Vehicle Routing on Trees

ACM Transactions on Algorithms (TALG) , Volume 19 (2): 28 – Mar 10, 2023

Loading next page...
 
/lp/association-for-computing-machinery/a-ptas-for-capacitated-vehicle-routing-on-trees-Evx0hT09kc

References (33)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2023 Association for Computing Machinery.
ISSN
1549-6325
eISSN
1549-6333
DOI
10.1145/3575799
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Algorithms (TALG)Association for Computing Machinery

Published: Mar 10, 2023

Keywords: Approximation algorithms

There are no references for this article.