Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
From MaRDI portal
Publication:2046271
Recommendations
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- PTAS for the Euclidean capacitated vehicle routing problem in \(\mathbb R^d\)
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
Cites work
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- A PTAS for bounded-capacity vehicle routing in planar graphs
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Advances in metric embedding theory
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
- Bounds and Heuristics for Capacitated Routing Problems
- Bypassing the embedding
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Knowledge-guided local search for the vehicle routing 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 \(\mathbb R^d\)
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
- Probabilistic checking of proofs
- The Euclidean traveling salesman problem is NP-complete
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- The truck dispatching problem
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
- Vehicle Routing
Cited in
(5)- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
This page was built for publication: Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046271)
