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

From MaRDI portal

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

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Polynomial_capacity_guarantees_PTAS_for_the_Euclidean_capacitated_vehicle_routing_problem_even_for_non-uniform_non-splittable_demand&oldid=72204120"