scientific article; zbMATH DE number 6297716
From MaRDI portal
Publication:5417633
Recommendations
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- On Euclidean Vehicle Routing with Allocation
- On Euclidean vehicle routing with allocation
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
Cited in
(20)- The Euclidean vehicle routing problem with multiple depots and time windows
- Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- A PTAS for the geometric connected facility location problem
- Capacitated vehicle routing with nonuniform speeds
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Capacitated vehicle routing with non-uniform speeds
- scientific article; zbMATH DE number 5863215 (Why is no real title available?)
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Locating depots for capacitated vehicle routing
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- A tight 4/3 approximation for capacitated vehicle routing in 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
- Algorithms and Data Structures
- Minimizing the maximum flow time in the online food delivery problem
- Approximation algorithms for the airport and railway problem
- Approximation algorithms for the airport and railway problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417633)
