New virtual issue available from Networks


  • Author: Statistics Views
  • Date: 04 September 2013

Networks has published a virtual issue on 'Network Interdiction Applications and Extensions' with all articles free to access here for a limited period.

A renewed emphasis on security-related research in the fields of operation research, computer science and mathematics has recently given rise to a slate of high-impact research papers in the field of network interdiction. This research area led to the idea of a virtual special issue on this theme of network applications and extensions.

This special issue includes eight papers that have appeared in Networks since 2002. These eight works collectively represent a small sample that Networks is proud to offer to the research community to promote further investigation into this growing and important area.

thumbnail image: New virtual issue available from Networks

They are as follows:

Adversarial models for priority-based networks
C. Àlvarez, M. Blesa, J. Díaz, M. Serna, A. Fernández
From the abstract: In this article, we propose several variations of the adversarial queueing model and address stability issues of networks and protocols in those proposed models. The first such variation is the priority model, which is directed at static network topologies and takes into account the case in which packets can have different priorities..

Shortest path network interdiction with asymmetric information
Halil Bayrak, Matthew D. Bailey M.D.
From the abstract: We consider an extension of the shortest path network interdiction problem. In this problem an evader attempts to minimize the length of the shortest path between the origin and the destination in a network, while an interdictor attempts to maximize the length of this shortest path by interdicting network arcs using limited resources...

Theoretical and computational advances for network diversion
Christopher A. Cullenbine, R. Kevin Wood, Alexandra M. Newman
From the abstract: The network-diversion problem (ND) is defined on a directedor undirected graph G = (V,E) having non-negative edge weights, a source vertex s, a sink vertex t, and a “diversion edge” . This problem, with intelligence-gathering and war-fighting applications, seeks a minimum-weight, minimal s-t cut in G such that ..

Shortest-path network interdiction
Eitan Israeli, R. Kevin Wood
From the abstract: We study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget. We formulate this bilevel, max–min problem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decomposition algorithms...

Reformulation and sampling to solve a stochastic network interdiction problem
Udom Janjarassuk, Jeff Linderoth
From the abstract: The network interdiction problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget constraint limits the amount of the network that can be destroyed. In this article, we study a stochastic version of the network interdiction problem in which the successful destruction of an arc of the network is a Bernoulli random variable, and the objective is to minimize the maximum expected flow of the adversary...

Minimizing a stochastic maximum-reliability path
Feng Pan, David P. Morton
From the abstract: We consider a stochastic network interdiction problem in which the goal is to detect an evader, who selects a maximum-reliability path. Subject to a resource constraint, the interdictor installs sensors on a subset of the network's arcs to minimize the value of the evader's maximum-reliability path, i.e., to maximize the detection probability...

Deception tactics for network interdiction: A multiobjective approach
Javier Salmerón
From the abstract: This article develops defender-attacker network interdiction models with deception. Here, deception refers to a preemptive and intelligent use of concealed interdiction assets and decoys by the defender, in addition to transparent assets commonly employed in modeling defender-attacker problems...

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Siqian Shen, J. Cole Smith
From the abstract: We examine variants of the critical node problem on specially structured graphs, which aim to identify a subset of nodes whose removal will maximally disconnect the graph...

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.