13 citations · 24 across the 24 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024★ 1 cited
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs under interval budgeted uncertainty
Adam Kasperski, Marcel Jackiewicz, Pawel Zielinski
In this paper, we consider the recoverable robust shortest path problem in acyclic digraphs, employing interval budgeted uncertainty to model uncertain second-stage costs. For the…
cs.DS2024
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…