Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656)
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: Pinpointing the complexity of the interval min-max regret knapsack problem |
scientific article; zbMATH DE number 6048237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pinpointing the complexity of the interval min-max regret knapsack problem |
scientific article; zbMATH DE number 6048237 |
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
