Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157)
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: Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty |
scientific article |
Statements
Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (English)
0 references
17 August 2018
0 references
robust optimization
0 references
\(k\)-adaptability
0 references
discrete uncertainty
0 references
