A branch-and-cut algorithm for the minimum branch vertices spanning tree problem

From MaRDI portal

Jump to:navigation, search

WRNING: 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-cut_algorithm_for_the_minimum_branch_vertices_spanning_tree_problem&oldid=74303085"