Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:05, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cost-effective allocations of bounded and binary resources in polynomial time |
scientific article |
Statements
Cost-effective allocations of bounded and binary resources in polynomial time (English)
0 references
1982
0 references
resource allocation
0 references
ratio optimization
0 references
polynomial algorithm
0 references
linear resources
0 references
discrete resources
0 references
concave activities
0 references
binary effectiveness values
0 references
algorithms
0 references
upper bound
0 references
