Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
André Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss
| Year of publication: |
2019
|
|---|---|
| Authors: | Chassein, André ; Goerigk, Marc ; Kurtz, Jannis ; Poss, Michael |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 279.2019, 2 (1.12.), p. 308-319
|
| Subject: | Combinatorial optimization | Robust optimization | k-adaptability | Budgeted uncertainty | Branch-and-bound algorithms | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics | Scheduling-Verfahren | Scheduling problem | Risiko | Risk | Branch-and-Bound | Branch and Bound |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2019.05.045 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012110700