A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem

From MaRDI portal

(Redirected from Publication:2496041)

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_tabu_search_algorithm_for_the_Min-Max_%5C(k%5C)-Chinese_postman_problem&oldid=73494672"