Robust recoverable 0-1 optimization problems under polyhedral uncertainty
| Year of publication: |
2019
|
|---|---|
| Authors: | Hradovich, Mikita ; Kasperski, Adam ; Zieliński, Paweł |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 278.2019, 1 (1.10.), p. 136-148
|
| Subject: | Robustness and sensitivity analysis | Combinatorial optimization | Recoverable robustness | Polyhedral uncertainty | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Sensitivitätsanalyse | Sensitivity analysis | Risiko | Risk | Entscheidung unter Unsicherheit | Decision under uncertainty |
-
Two-Stage robust optimization problems with two-stage uncertainty
Goerigk, Marc, (2022)
-
Recoverable robust representatives selection problems with discrete budgeted uncertainty
Goerigk, Marc, (2022)
-
Stability advances in robust portfolio optimization under parallelepiped uncertainty
Kara, Güray, (2019)
- More ...
-
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André, (2020)
-
On recoverable and two-stage robust selection problems with budgeted uncertainty
Chassein, André, (2018)
-
Risk-averse single machine scheduling : complexity and approximation
Kasperski, Adam, (2019)
- More ...