Pinpointing the complexity of the interval min-max regret knapsack problem (Q429656): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C47 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6048237 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
robust optimization | |||
| Property / zbMATH Keywords: robust optimization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomial hierarchy | |||
| Property / zbMATH Keywords: polynomial hierarchy / rank | |||
Normal rank | |||
Revision as of 23:35, 29 June 2023
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
