Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
From MaRDI portal
Publication:2048811
Recommendations
- Efficient approximation of the metric CVRP in 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
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
Cites work
- 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 PTAS for bounded-capacity vehicle routing in planar graphs
- 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
- 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
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- Bypassing the embedding
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- scientific article; zbMATH DE number 1559543 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Knowledge-guided local search for the vehicle routing problem
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- 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^*
- PTAS for the Euclidean capacitated vehicle routing problem in R^d
- The Euclidean traveling salesman problem is NP-complete
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- The truck dispatching problem
- Vehicle Routing
- VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
Cited in
(8)- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary 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
- scientific article; zbMATH DE number 5667551 (Why is no real title available?)
- 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
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
This page was built for publication: Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048811)
