Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(82)90112-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026717830 / rank | |||
Normal rank | |||
Revision as of 18:40, 19 March 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
