The shortest path network interdiction (SPNI) problem poses significant computational challenges due to its NP-hardness. Current solutions, primarily based on integer programming methods, are inefficient for large-scale instances. In this paper, we introduce a novel hybrid algorithm that can utilize Ising Processing Units (IPUs) alongside classical solvers. This approach decomposes the problem into manageable sub-problems, which are then offloaded to the slow but high-quality classical solvers or IPU. Results are subsequently recombined to form a global solution. Our method demonstrates comparable quality to existing whole problem solvers while reducing computational time for large-scale instances. Furthermore, our approach is amenable to parallelization, allowing for simultaneous processing of decomposed sub-problems.

翻译：最短路径网络拦截（SPNI）问题因其NP-hard性而面临显著的计算挑战。当前主要基于整数规划方法的解决方案在处理大规模实例时效率低下。本文提出了一种新颖的混合算法，能够同时利用伊辛处理单元（IPU）与经典求解器。该方法将问题分解为可管理的子问题，随后将这些子问题交由速度较慢但质量较高的经典求解器或IPU处理，最后将结果重新组合以形成全局解。我们的方法在保持与现有全问题求解器相当的解质量的同时，减少了大规模式例的计算时间。此外，该方法易于并行化，支持对分解后的子问题进行同步处理。