On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty

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]

@article{ChasseinG21,
  title = {On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty},
  author = {André B. Chassein and Marc Goerigk},
  year = {2021},
  doi = {10.1016/j.dam.2020.05.017},
  url = {https://doi.org/10.1016/j.dam.2020.05.017},
  researchr = {https://researchr.org/publication/ChasseinG21},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {296},
  pages = {141-163},
}