Journal
EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION
Volume 6, Issue 3, Pages 211-238Publisher
ELSEVIER
DOI: 10.1007/s13675-018-0103-0
Keywords
Robust optimization; Uncertainty; Combinatorial optimization; Two-stage robustness; K-Adaptability; Complexity
Categories
Funding
- German Research Foundation (DFG) within the Research Training Group 1855 [BU 2313/2]
Ask authors/readers for more resources
In this survey, we discuss the state of the art of robust combinatorial optimization under uncertain cost functions. We summarize complexity results presented in the literature for various underlying problems, with the aim of pointing out the connections between the different results and approaches, and with a special emphasis on the role of the chosen uncertainty sets. Moreover, we give an overview over exact solution methods for NP-hard cases. While mostly concentrating on the classical concept of strict robustness, we also cover more recent two-stage optimization paradigms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available