A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems

From MaRDI portal

(Redirected from A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems)

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_Lagrangian_relaxation-based_heuristic_to_solve_large_extended_graph_partitioning_problems&oldid=79781444"