A Dynamic Network Interdiction Problem

Authors:
Brian J. Lunday;Hanif D. Sherali
Affiliations:
Department of Mathematical Sciences, United States Military Academy, West Point, NY 10996, USA;Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA, e-mail: brian.lunday@usma.edu, hanifs@vt.edu
Venue:
Informatica
Year:
2010

Citing 5
Cited 1

The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Defending Critical Infrastructure

Interfaces
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem

INFORMS Journal on Computing
Multi-Attribute Decision-Making Model by Applying Grey Numbers

Informatica
Multiple Criteria Comparative Evaluation of E-Learning Systems and Components

Informatica

Maximum dynamic network flow interdiction problem: New formulation and solution procedures

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the network from a designated source to a known terminus, wherein the agents may modify strategies in selected subsequent periods according to respective decision and implementation cycles. For the resulting minimax model, we develop a reformulation that facilitates a direct solution procedure using commercial software or via a proposed alternating heuristic. We examine certain related stability and convergence issues, demonstrate special convergence cases, and provide insights into the computational performance of the solution procedures.