The following publications are possibly variants of this publication:
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertaintyAndré B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss. eor, 279(2):308-319, 2019. [doi]
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertaintyChristoph Buchheim, Jannis Kurtz. disopt, 28:1-15, 2018. [doi]
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertaintyAndré B. Chassein, Marc Goerigk. DAM, 296:141-163, 2021. [doi]
- Min-max-min robust combinatorial optimizationChristoph Buchheim, Jannis Kurtz. mp, 163(1-2):1-23, 2017. [doi]
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutionsChristoph Buchheim, Jannis Kurtz. endm, 52:45-52, 2016. [doi]
- Recoverable robust representatives selection problems with discrete budgeted uncertaintyMarc Goerigk, Stefan Lendl, Lasse Wulf. eor, 303(2):567-580, 2022. [doi]
- Contributions to robust combinatorial optimization with budgeted uncertaintyMichael Poss. 2016. [doi]
- Robust combinatorial optimization with variable budgeted uncertaintyMichael Poss. 4or, 11(1):75-92, 2013. [doi]
- Robust combinatorial optimization under budgeted-ellipsoidal uncertaintyJannis Kurtz. ejco, 6(4):315-337, 2018. [doi]
- Robust Combinatorial Optimization with Locally Budgeted UncertaintyMarc Goerigk, Stefan Lendl. ojmo, 2:1-18, 2021. [doi]