The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Applying the Minimum Risk Criterion in Stochastic Recourse Programs
Computational Optimization and Applications
Stochastic Network Interdiction
Operations Research
Network Interdiction and Stochastic Integer Programming
Network Interdiction and Stochastic Integer Programming
A constrained binary knapsack approximation for shortest path network interdiction
Computers and Industrial Engineering
| Hi-index | 0.00 |
We describe and compare heuristic solution methods for a multi-stage stochastic network interdiction problem. The problem is to maximize the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain. In this formulation, interdiction subject to a budget constraint is followed by operation of the network, which is then followed by a second interdiction subject to a second budget constraint. Computational results demonstrate and compare the effectiveness of heuristic algorithms. This problem is interesting in that computing an objective function value requires tremendous effort. We exhibit classes of instances in our computational experiments where local search based on a transformation neighborhood is dominated by a constructive neighborhood.