On recoverable and two-stage robust selection problems with budgeted uncertainty
Year of publication: |
1 March 2018
|
---|---|
Authors: | Chassein, André ; Goerigk, Marc ; Kasperski, Adam ; Zieliński, Paweł |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 265.2018, 2 (1.3.), p. 423-436
|
Subject: | Combinatorial optimization | Robust optimization | Selection problem | Budgeted uncertainty | Two-stage robustness | Recoverable robustness | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Risiko | Risk | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Robust combinatorial optimization under convex and discrete cost uncertainty
Buchheim, Christoph, (2018)
-
Robust combinatorial optimization with variable cost uncertainty
Poss, Michael, (2014)
-
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
Kurtz, Jannis, (2018)
- More ...
-
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André, (2020)
-
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
Chassein, André, (2018)
-
The quadratic shortest path problem : complexity, approximability, and solution methods
Rostami, Borzou, (2018)
- More ...