Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints

From MaRDI portal

(Redirected from Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints)

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=Asymptotic_optimality_of_a_greedy_randomized_algorithm_in_a_large-scale_service_system_with_general_packing_constraints&oldid=72403011"