Abstract
The chapter focuses on treating a particular problem of intelligent threats. We consider a least cost attack in a network-interdiction framework with a single source and a single destination. We suppose that a network is disabled if all links of a full cut set fail. That is, no flow can reach its destination node. We propose an exact solution under a budget constraint accounting for a threshold of success probability of the attack on targeted cut sets. We investigate the efficiency of the suggested solution through some illustrations. We extend the results to the case of networks with multiple sources/destinations.