Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand

DOI10.1007/978-3-030-38603-0_30zbMath1477.90086OpenAlexW2999536959MaRDI QIDQ1982923

Yuri Ogorodnikov, Mikhail Yu. Khachay

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_30

zbMATH Keywords

capacitated vehicle routing problempolynomial time approximation schemenon-uniform splittable demand

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

This page was built for publication: Polynomial capacity guarantees PTAS for the Euclidean capacitated vehicle routing problem even for non-uniform non-splittable demand