Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
The recoverable robust shortest path problem with discrete recourse is Σp3-hard for the arc exclusion and arc symmetric difference neighborhoods, and the inner adversarial problem for these neighborhoods is Πp2-hard.
