Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
DOI10.1134/S0081543819070058zbMATH Open1435.90122OpenAlexW3014020939MaRDI QIDQ2185641FDOQ2185641
Authors: Yu. Yu. Ogorodnikov, M. Yu. Khachaĭ 
Publication date: 5 June 2020
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543819070058
Recommendations
- Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- The truck dispatching problem
- Title not available (Why is that?)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Bounds and Heuristics for Capacitated Routing Problems
- The Euclidean vehicle routing problem with multiple depots and time windows
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Title not available (Why is that?)
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- Title not available (Why is that?)
- PTAS for the Euclidean capacitated vehicle routing problem in \(\mathbb R^d\)
Cited In (11)
- A quasi-polynomial time approximation scheme for Euclidean CVRPTW
- Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
- Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
- Title not available (Why is that?)
- Approximation schemes for Euclidean vehicle routing problems with time windows
- An optimization algorithm for a capacitated vehicle routing problem with time windows
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Solving an On-Line Capacitated Vehicle Routing Problem with Structured Time Windows
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
Uses Software
This page was built for publication: Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185641)
