Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
| Year of publication: |
1 September 2018
|
|---|---|
| Authors: | Chassein, André ; Goerigk, Marc |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 269.2018, 2 (1.9.), p. 544-555
|
| Subject: | Robustness and sensitivity analysis | Robust combinatorial optimization | Min-max regret | Variable-sized uncertainty | Robustes Verfahren | Robust statistics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Risiko | Risk | Entscheidung unter Unsicherheit | Decision under uncertainty | Sensitivitätsanalyse | Sensitivity analysis | Scheduling-Verfahren | Scheduling problem |
-
Fu, Na, (2015)
-
Recoverable robust representatives selection problems with discrete budgeted uncertainty
Goerigk, Marc, (2022)
-
Two-Stage robust optimization problems with two-stage uncertainty
Goerigk, Marc, (2022)
- More ...
-
Variable-sized uncertainty and inverse problems in robust optimization
Chassein, André, (2018)
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
-
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André, (2020)
- More ...