Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:58, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pinpointing the complexity of the interval min-max regret knapsack problem |
scientific article |
Statements
Pinpointing the complexity of the interval min-max regret knapsack problem (English)
0 references
20 June 2012
0 references
robust optimization
0 references
computational complexity
0 references
polynomial hierarchy
0 references