On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:48, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the continuous unbounded knapsack problem with uncertain coefficients |
scientific article |
Statements
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (English)
0 references
25 August 2005
0 references
Polynomial algorithm
0 references
Complexity
0 references
Minmax regret optimization
0 references
