Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q207380 |
Changed an Item |
||
| Property / author | |||
| Property / author: Vladimir G. Deǐneko / rank | |||
Normal rank | |||
Revision as of 22:45, 10 February 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
