Return
Exact methods for disabling interdiction problems
DOI:10.1016/j.ejor.2026.09.023.png)
Abstract
En 中文
• The diversification methods significantly speed up our proposed approaches.
• The novel approaches outperform the state-of-the-art, especially on hard instances.
• For easier instances, the Covering Decomposition produces competitive results.
Keywords:
Bi-level optimisation
Binary interdiction problems
Covering decomposition
Single-level reformulation
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
No cited papers available

