Communication Line Protection Against Sabotages Using Dynamic Minimum Cut Interdiction

In ground wars, one of the enemy's main goals is to monitor communication networks and to interrupt the force and equipment lines. For this purpose, the optimal approach is to disconnect routes on a minimum cut. This is possible by air, missile, and artillery attacks, as well as the destruction of bridges and roads. On the other hand, the defense forces seek to exploit maximally the available resources and facilities to interdict the enemy reaching this goal. In this paper, we model this problem from the viewpoint of defense forces in the form of a bi-level network interdiction problem. Due to the inherent complexity and nature of the problem, we solve it using the Bender's decomposition approach. Finally, we establish the validity of the model by a practical example.