Solving the recoverable robust shortest path problem in DAGs
Marcel Jackiewicz, Adam Kasperski, Paweł Zieliński · arXiv (Cornell University) · 2023
This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable in general digraphs. Polynomial time algorithms for the problem under consideration in DAGs are proposed.