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 ...

We consider the dynamic version of the maximum flow network interdiction problem; that is, we assume

a positive number is assigned to each arc which indicates the traversal time of the flow through that arc.

We ...