A branch and bound algorithm for the minimax regret spanning arborescence

From MaRDI portal

(Redirected from A branch and bound algorithm for the minimax regret spanning arborescence)

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_branch_and_bound_algorithm_for_the_minimax_regret_spanning_arborescence&oldid=65036040"