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. The known complexity results for this problem are strengthened. It is shown that it is Sigma_3^p-hard for the arc exclusion and the arc symmetric difference neighborhoods. Furthermore, it is also proven that the inner adversarial problem for these neighborhoods is Pi_2^p-hard.

翻译：本文研究了可恢复鲁棒最短路径问题。采用离散有界区间不确定性表示来建模不确定的第二阶段弧成本。本文强化了该问题的已知复杂性结果。证明该问题在弧排除邻域和弧对称差邻域下是Sigma_3^p-难的。此外，还证明了这些邻域的内部对抗问题是Pi_2^p-难的。