Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disopt.2010.03.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2010.03.008 / rank | |||
Normal rank | |||
Revision as of 01:30, 9 December 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
