A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:07, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of optimality of the bottom up algorithm for discrete resource allocation problems |
scientific article |
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
