Solving the recoverable robust shortest path problem in DAGs

09/06/2023

∙

by   Marcel Jackiewicz, et al.

∙

0

∙

share

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.