5 citations · 10 across the 9 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
An Investigation of the Recoverable Robust Assignment Problem
Dennis Fischer, Tim A. Hartmann, Stefan Lendl +1
We investigate the so-called recoverable robust assignment problem on balanced bipartite graphs with vertices, a mainstream problem in robust optimization: For two given linea…
math.OC2020
Robust Combinatorial Optimization with Locally Budgeted Uncertainty
Marc Goerigk, Stefan Lendl
Budgeted uncertainty sets have been established as a major influence on uncertainty modeling for robust optimization problems. A drawback of such sets is that the budget constraint…
math.OC2020
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this appr…