Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand

DOI10.1007/978-3-030-22629-9_22zbMath1444.90099OpenAlexW2949660560MaRDI QIDQ2181770

Yuri Ogorodnikov, Mikhail Yu. Khachay

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_22

zbMATH Keywords

time windowscapacitated vehicle routing problempolynomial time approximation schemesplittable demand

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

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 ⋮ Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension

This page was built for publication: Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand