Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations
This article deals with the recoverable robust shortest path problem under interval
uncertainty representations. In this problem, a first‐stage path is computed, which can be …
uncertainty representations. In this problem, a first‐stage path is computed, which can be …
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
C Grüne, L Wulf - arXiv preprint arXiv:2411.18590, 2024 - arxiv.org
Recoverable robust optimization is a popular multi-stage approach, in which it is possible to
adjust a first-stage solution after the uncertain cost scenario is revealed. We consider …
adjust a first-stage solution after the uncertain cost scenario is revealed. We consider …
Recoverable robust shortest path problem under interval uncertainty representations
In this paper, the recoverable robust shortest path problem under interval uncertainty
representations is discussed. This problem is known to be strongly NP-hard and also hard to …
representations is discussed. This problem is known to be strongly NP-hard and also hard to …
On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
AB Tomasaz, M Carvalho, R Cordone… - arXiv preprint arXiv …, 2024 - arxiv.org
Fortification-interdiction games are tri-level adversarial games where two opponents act in
succession to protect, disrupt and simply use an infrastructure for a specific purpose. Many …
succession to protect, disrupt and simply use an infrastructure for a specific purpose. Many …
On the Complexity of the Bilevel Shortest Path Problem
D Henke, L Wulf - arXiv preprint arXiv:2412.21134, 2024 - arxiv.org
We introduce a new bilevel version of the classic shortest path problem and completely
characterize its computational complexity with respect to several problem variants. In our …
characterize its computational complexity with respect to several problem variants. In our …
Other Models for Robust Optimization
M Goerigk, M Hartisch - … Optimization: Concepts, Models and Algorithms for …, 2024 - Springer
Other Models for Robust Optimization | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
In this paper the recoverable robust shortest path problem is investigated. Discrete budgeted
interval uncertainty representation is used to model uncertain second-stage arc costs. The …
interval uncertainty representation is used to model uncertain second-stage arc costs. The …
Ηλ (x)= λ maxx+(1-1) min
M Goerigk, M Hartisch - An Introduction to Robust Combinatorial …, 2024 - books.google.com
Note that for λ= 1, we recover the min-max problem, which means that this approach is more
general (in particular, hardness results that apply to min-max problems also apply to …
general (in particular, hardness results that apply to min-max problems also apply to …
General Reformulation Results
M Goerigk, M Hartisch - … Optimization: Concepts, Models and Algorithms for …, 2024 - Springer
General Reformulation Results | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …