Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem
From MaRDI portal
Publication:3467845
DOI10.1007/978-3-319-26626-8_14zbMath1477.90007OpenAlexW2295683163MaRDI QIDQ3467845
Helen Zaytseva, Mikhail Yu. Khachay
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_14
Related Items
Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces ⋮ Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- Approximability of the problem about a minimum-weight cycle cover of a graph
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- The vehicle routing problem. Latest advances and new challenges.
- Minimum-weight cycle covers and their approximability
- The Euclidean traveling salesman problem is NP-complete
- Four-point conditions for the TSP: the complete complexity classification
- The Truck Dispatching Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- On Approximating Restricted Cycle Covers
- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
- Bounds and Heuristics for Capacitated Routing Problems
- P-Complete Approximation Problems
