Robust combinatorial optimization under convex and discrete cost uncertainty
Year of publication: |
2018
|
---|---|
Authors: | Buchheim, Christoph ; Kurtz, Jannis |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 6.2018, 3, p. 211-238
|
Subject: | Combinatorial optimization | Complexity | K-Adaptability | Robust optimization | Two-stage robustness | Uncertainty | Theorie | Theory | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Scheduling-Verfahren | Scheduling problem | Risiko | Risk |
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
-
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
Kurtz, Jannis, (2018)
-
On recoverable and two-stage robust selection problems with budgeted uncertainty
Chassein, André, (2018)
- More ...
-
Oracle-based algorithms for binary two-stage robust optimization
Kämmerling, Nicolas, (2020)
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
-
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
Kurtz, Jannis, (2018)
- More ...