Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty

From MaRDI portal
Publication:1662157

DOI10.1016/j.disopt.2017.08.006zbMath1474.90371OpenAlexW2767276898MaRDI QIDQ1662157

Jannis Kurtz, Christoph Buchheim

Publication date: 17 August 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.08.006




Related Items (8)



Cites Work


This page was built for publication: Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty