Optimality and greed in dynamic allocation

DOI10.1006/JAGM.2001.1198zbMATH Open1017.68150OpenAlexW2045781993MaRDI QIDQ2775889FDOQ2775889

Authors: Peter Winkler 

Publication date: 8 July 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2001.1198

Recommendations

• Analysis of Simple Algorithms for Dynamic Load Balancing
• Optimization of static traffic allocation policies
• Optimal Dynamic Server Allocation in Systems with On/Off Sources
• scientific article; zbMATH DE number 4046862
• A provably efficient algorithm for dynamic storage allocation

zbMATH Keywords

dynamic allocation items

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (10)

• Title not available (Why is that?)
• Efficient allocations under ambiguity
• The Dubovickij-Miljutin lemma and characterizations of optimal allocations in non-smooth economies
• Pareto optimal allocations and dynamic programming
• Title not available (Why is that?)
• ON A ROUTING PROBLEM
• Greed in resource scheduling
• Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
• Station assignment with reallocation
• On the optimality of not allocating

This page was built for publication: Optimality and greed in dynamic allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775889)