Improved approximations for capacitated vehicle routing with unsplittable client demands
From MaRDI portal
Publication:2164702
DOI10.1007/978-3-031-06901-7_19zbMath1497.90172arXiv2111.08138OpenAlexW4285190221MaRDI QIDQ2164702
Zachary Friggstad, Mirmahdi Rahgoshay, Ramin Mousavi, Mohammad R. Salavatipour
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2111.08138
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- A PTAS for bounded-capacity vehicle routing in planar graphs
- A framework for vehicle routing approximation schemes in trees
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
- The Truck Dispatching Problem
- PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
- Bounds and Heuristics for Capacitated Routing Problems
- Capacitated arc routing problems
- Capacitated Vehicle Routing on Trees
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- The Traveling Salesman Problem with Distances One and Two
- 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
This page was built for publication: Improved approximations for capacitated vehicle routing with unsplittable client demands
