A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem

From MaRDI portal

(Redirected from A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem)

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=A_3/2-Approximation_Algorithm_for_Multiple_Depot_Multiple_Traveling_Salesman_Problem&oldid=81051293"