Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
André B. Chassein, Marc Goerigk. On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discrete Applied Mathematics, 296:141-163, 2021. [doi]
Possibly Related PublicationsThe 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] Min-max-min robustness for combinatorial problems with discrete budgeted uncertaintyMarc Goerigk, Jannis Kurtz, Michael Poss. DAM, 285:707-725, 2020. [doi]
The following publications are possibly variants of this publication: