On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7335291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty |
scientific article; zbMATH DE number 7335291 |
Statements
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (English)
0 references
20 April 2021
0 references
robust optimization
0 references
min-max-min robustness
0 references
combinatorial optimization
0 references
budgeted uncertainty
0 references
approximation
0 references
0 references
0 references
0 references
0.907961130142212
0 references
0.9042702317237854
0 references
0.8704975247383118
0 references
0.8654195666313171
0 references
