Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2017.08.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2767276898 / rank | |||
Normal rank | |||
Revision as of 20:57, 19 March 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
