Deterministic network interdiction

Authors:
R.Kevin Wood
Affiliations:
Operations Research Department, Naval Postgraduate School Monterey, CA 93940, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1993

Citing 1
Cited 25

Integer and combinatorial optimization

Integer and combinatorial optimization

A bilevel mixed-integer program for critical infrastructure protection planning

Computers and Operations Research
Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Computers and Operations Research
Network flow interdiction on planar graphs

Discrete Applied Mathematics
A bi-objective approach for shortest-path network interdiction

Computers and Industrial Engineering
Matching interdiction

Discrete Applied Mathematics
The most vital nodes with respect to independent set and vertex cover

Discrete Applied Mathematics
Critical infrastructure protection: The vulnerability conundrum

Telematics and Informatics
A constrained binary knapsack approximation for shortest path network interdiction

Computers and Industrial Engineering
Matrix interdiction problem

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Efficient determination of the k most vital edges for the minimum spanning tree problem

Computers and Operations Research
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability

Operations Research Letters
Deception tactics for network interdiction: A multiobjective approach

Networks
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

Networks
The r-interdiction median problem with probabilistic protection and its solution algorithm

Computers and Operations Research
Gelling, and melting, large graphs by edge manipulation

Proceedings of the 21st ACM international conference on Information and knowledge management
Branch and cut algorithms for detecting critical nodes in undirected graphs

Computational Optimization and Applications
Complexity of determining the most vital elements for the p-median and p-center location problems

Journal of Combinatorial Optimization
Packing interdiction and partial covering problems

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Maximum dynamic network flow interdiction problem: New formulation and solution procedures

Computers and Industrial Engineering
Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption

Computers and Operations Research
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms

Computers and Operations Research
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

Journal of Combinatorial Optimization
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Discrete Applied Mathematics
A cutting-plane algorithm for solving a weighted influence interdiction problem

Computational Optimization and Applications
Protection issues for supply systems involving random attacks

Computers and Operations Research

Quantified Score

Hi-index	0.98

Visualization

Abstract

Interest in network interdiction has been rekindled because of attempts to reduce the flow of drugs and precursor chemicals moving through river and road networks in South America. This paper considers a problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources. This problem is shown to be NP-complete even when the interdiction of an arc requires exactly one unit of resource. New, flexible, integer programming models are developed for the problem and its variations and valid inequalities and a reformulation are derived to tighten the LP relaxations of some of these models. A small computational example from the literature illustrates a hybrid (partly directed and partly undirected) model and the usefulness of the valid inequalities and the reformulation.