Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:38, 1 February 2024
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
