PTAS for the Euclidean capacitated vehicle routing problem in R^d
From MaRDI portal
Publication:3133213
DOI10.1007/978-3-319-44914-2_16zbMATH Open1385.90002OpenAlexW2559541197MaRDI QIDQ3133213FDOQ3133213
Authors: Roman D. Dubinin, M. Yu. Khachaĭ 
Publication date: 13 February 2018
Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_16
Recommendations
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand
- An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
Cited In (21)
- Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
- PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k\)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- A PTAS for Capacitated Vehicle Routing on Trees
- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
- A fast \((2 + 2/7)\)-approximation algorithm for capacitated cycle covering
- A PTAS for bounded-capacity vehicle routing in planar graphs
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Improving the approximation ratio for capacitated vehicle routing
- 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
- Improving the approximation ratio for capacitated vehicle routing
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Multi-shuttle crane scheduling in automated storage and retrieval systems
- Iterated tour partitioning for Euclidean capacitated vehicle routing
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- Minimizing the maximum flow time in the online food delivery problem
- PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\)
This page was built for publication: PTAS for the Euclidean capacitated vehicle routing problem in \(\mathbb R^d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133213)
