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