A Decomposition Algorithm for Planning the Interdiction of Stochastic Networks

Speaker: Harald Held, CIPIC

Date: January 22, 2003

Abstract:
We describe a decomposition based solution method for a new, important class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Schultz. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements.