Formulations and algorithms for the recoverable -robust knapsack problem
| Year of publication: |
2019
|
|---|---|
| Authors: | Büsing, Christina ; Goderbauer, Sebastian ; Koster, Arie M.C.A. ; Kutschka, Manuel |
| Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 7.2019, 1, p. 15-45
|
| Subject: | Robustness | Budget uncertainty | Integer programming under uncertainty | Knapsack | Recoverable robustness | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Risiko | Risk | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Robustes Verfahren | Robust statistics | Entscheidung unter Unsicherheit | Decision under uncertainty |
-
Decomposition approaches for recoverable robust optimization problems
Akker, J. M. van den, (2016)
-
Improved handling of uncertainty and robustness in set covering problems
Lutter, Pascal, (2017)
-
Robust recoverable 0-1 optimization problems under polyhedral uncertainty
Hradovich, Mikita, (2019)
- More ...
-
Improved handling of uncertainty and robustness in set covering problems
Lutter, Pascal, (2017)
-
Lübbecke, Marco, (2016)
-
Special issue: computational discrete optimization
Koster, Arie M.C.A., (2020)
- More ...