Robust combinatorial optimization problems under budgeted interdiction uncertainty
M Goerigk, M Khosravi - OR Spectrum, 2024 - Springer
In robust combinatorial optimization, we would like to find a solution that performs well under
all realizations of an uncertainty set of possible parameter values. How we model this …
all realizations of an uncertainty set of possible parameter values. How we model this …
A large and natural Class of - and -complete Problems in Bilevel and Robust Optimization
C Grüne, L Wulf - arXiv preprint arXiv:2311.10540, 2023 - arxiv.org
Because $\Sigma^ p_2 $-and $\Sigma^ p_3 $-hardness proofs are usually tedious and
difficult, not so many complete problems for these classes are known. This is especially true …
difficult, not so many complete problems for these classes are known. This is especially true …