Algorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems


We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum profit that can be obtained from shipping commodities across the network. The attacker is assumed to have some budget for destroying (or “interdicting”) arcs, and each arc is associated with a… (More)


6 Figures and Tables

Slides referencing similar topics