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难度。