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_30MaRDI QIDQ1982923zbMATH OpenOpenAlexFDO

Authors Yuri Ogorodnikov, M. Yu. Khachaĭ

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)

Recommendations

• Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
• Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
• PTAS for the Euclidean capacitated vehicle routing problem in \(\mathbb R^d\)
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• scientific article; zbMATH DE number 6297716

Cited in

(3)

• PTAS for the Euclidean capacitated vehicle routing problem in \(\mathbb R^d\)
• Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
• Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982923)