A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A short proof of optimality of the bottom up algorithm for discrete resource allocation problems |
scientific article; zbMATH DE number 1089842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of optimality of the bottom up algorithm for discrete resource allocation problems |
scientific article; zbMATH DE number 1089842 |
Statements
A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (English)
0 references
19 November 1997
0 references
separable concave function
0 references
polymatroid
0 references
resource allocation
0 references
bottom up algorithm
0 references
greedy algorithm
0 references
0 references
0 references
0.8404643535614014
0 references
0.7594451308250427
0 references
0.7589589357376099
0 references