Maximum dynamic flow interdiction problem Let G = (N, A) be a directed graph with a given source node s, and a given sink node t. Let N = (G, u, τ, r) be the associated dynamic network with arc capacities u, flow traversal times τ, and arc interdiction costs r. The problem is to find a set of arcs whose removal will minimize the maximum flow from s to t within a given time period of T, subject to budget limitation. This is in fact the dynamic version of the well known max flow interdiction problem. We present a new formulation based on the concept of temporally repeated flows and discuss two solution approaches for this problem. Some numerical results will also be presented.

Keywords