A PTAS for Capacitated Vehicle Routing on Trees

DOI10.1145/3575799arXiv2111.03735MaRDI QIDQ6075752

Hang Zhou, Claire Mathieu

Publication date: 23 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03735

zbMATH Keywords

combinatorial optimizationgraph algorithmsapproximation algorithmscapacitated vehicle routing

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Improved bounds for vehicle routing solutions
• The vehicle routing problem. Latest advances and new challenges.
• A PTAS for bounded-capacity vehicle routing in planar graphs
• A framework for vehicle routing approximation schemes in trees
• The Truck Dispatching Problem
• PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k
• PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Bounds and Heuristics for Capacitated Routing Problems
• Capacitated arc routing problems
• Capacitated Vehicle Routing on Trees
• Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
• A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
• Improving the approximation ratio for capacitated vehicle routing
• A new approximation algorithm for the capacitated vehicle routing problem on a tree

This page was built for publication: A PTAS for Capacitated Vehicle Routing on Trees