The complexity of finding most vital arcs and nodes
The complexity of finding most vital arcs and nodes
Stochastic Network Interdiction
Operations Research
Reformulation and sampling to solve a stochastic network interdiction problem
Networks - Games, Interdiction, and Human Interaction Problems on Networks
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
INFORMS Journal on Computing
Discrete Applied Mathematics
A Dynamic Network Interdiction Problem
Informatica
A constrained binary knapsack approximation for shortest path network interdiction
Computers and Industrial Engineering
Deterministic network interdiction
Mathematical and Computer Modelling: An International Journal
Operations Research Letters
Most vital links and nodes in weighted networks
Operations Research Letters
Finding the most vital arcs in a network
Operations Research Letters
| Hi-index | 0.00 |
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 also assume that an intruder uses a single resource with limited budget to interrupt the flow of a single commodity through the network within a given time limit of T. A new formulation based on the concept of Temporally Repeated Flow (TRF) is presented. The problem is then solved using Benders' decomposition. Another solution method, based on the most vital arcs in a network is also discussed. Finally, some computational results are reported.