Unsplittable Euclidean capacitated vehicle routing: a (2+)-approximation algorithm

DOI10.4230/LIPICS.ITCS.2023.63MaRDI QIDQ6610331FDOQ6610331

Claire Mathieu, Fabrizio Grandoni, Hang Zhou

Publication date: 25 September 2024

zbMATH Keywords

approximation algorithmscapacitated vehicle routingEuclidean plane

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Unsplittable Euclidean capacitated vehicle routing: a \((2+\varepsilon)\)-approximation algorithm

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