Recoverable robust optimization with discrete budgeted uncertainty is Sigma-3-p-complete for a broad class of NP-hard nominal problems, via new blow-up SSP reductions.
Recoverable robust shortest path problems
1 Pith paper cite this work, alongside 54 external citations. Polarity classification is still indexing.
1
Pith paper citing it
54
external citations · OpenAlex
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
Recoverable robust optimization with discrete budgeted uncertainty is Sigma-3-p-complete for a broad class of NP-hard nominal problems, via new blow-up SSP reductions.