Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty |
scientific article |
Statements
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (English)
0 references
5 July 2019
0 references
combinatorial optimization
0 references
robust optimization
0 references
\(k\)-adaptability
0 references
budgeted uncertainty
0 references
branch-and-bound algorithms
0 references
0 references
0 references
0 references
0 references
0 references
