Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

From MaRDI portal

(Redirected from Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment 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=Polynomial_algorithms_for_finding_the_asymptotically_optimum_plan_of_the_multiindex_axial_assignment_problem&oldid=64899387"