The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm

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=The_min-degree_constrained_minimum_spanning_tree_problem:_formulations_and_branch-and-cut_algorithm&oldid=62280525"