Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898)
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: Cost-effective allocations of bounded and binary resources in polynomial time |
scientific article; zbMATH DE number 3777279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cost-effective allocations of bounded and binary resources in polynomial time |
scientific article; zbMATH DE number 3777279 |
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
