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难性质，带来了显著的计算挑战。当前的解决方案主要基于整数规划方法，难以高效处理大规模实例。本文提出了一种新颖的混合算法，该算法能够利用伊辛处理单元（IPU）与经典求解器协同工作。该方法将问题分解为可管理的子问题，随后将子问题分配给速度较慢但质量较高的经典求解器或IPU进行处理。最终，各子问题的结果被重新组合以形成全局解。我们的方法在保证与现有全局求解器相当的解质量的同时，显著减少了大规模实例的计算时间。此外，本方法具有良好的并行化特性，能够同时处理分解后的子问题。