1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2026★ 1 cited
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
Marcel Jackiewicz, Adam Kasperski, PaweÅ ZieliÅski
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.…
cs.DS2026
Recoverable robust shortest path problem under interval budgeted uncertainty representations
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
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 a…