Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows

DOI10.1134/S0081543819070058zbMath1435.90122OpenAlexW3014020939MaRDI QIDQ2185641

Yu. Yu. Ogorodnikov, Mikhail Yu. Khachay

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

zbMATH Keywords

time windowscapacitated vehicle routing problemefficient polynomial-time approximation scheme

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension ⋮ Efficient approximation of the metric CVRP in spaces of fixed doubling dimension

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for Euclidean vehicle routing problems with time windows
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• The Euclidean vehicle routing problem with multiple depots and time windows
• The Truck Dispatching Problem
• PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
• 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

This page was built for publication: Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows