Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
From MaRDI portal
Publication:1675324
DOI10.1134/S0081543817050133zbMath1397.90329OpenAlexW2404658402MaRDI QIDQ1675324
Roman D. Dubinin, Mikhail Yu. Khachay
Publication date: 27 October 2017
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543817050133
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Efficient approximation of the metric CVRP in spaces of fixed doubling dimension ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
Uses Software
Cites Work
- Unnamed Item
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
- Approximability of the minimum-weight \(k\)-size cycle cover problem
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- The Euclidean traveling salesman problem is NP-complete
- The Truck Dispatching Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem
- Bounds and Heuristics for Capacitated Routing Problems
- Spherical Radial Basis Functions, Theory and Applications
This page was built for publication: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
