PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
From MaRDI portal
Publication:3133213
DOI10.1007/978-3-319-44914-2_16zbMath1385.90002OpenAlexW2559541197MaRDI QIDQ3133213
Roman D. Dubinin, Mikhail Yu. Khachay
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
Related Items (14)
A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering ⋮ Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ Multi-shuttle crane scheduling in automated storage and retrieval systems ⋮ Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ Iterated tour partitioning for Euclidean capacitated vehicle routing ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ 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 ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
This page was built for publication: PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
