Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding

From MaRDI portal

(Redirected from Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding)

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=Decomposition_algorithms_for_data_placement_problem_based_on_Lagrangian_relaxation_and_randomized_rounding&oldid=62228178"