We consider a network interdiction problem on a multicommodity flow network, in which an
attacker disables a set of network arcs in order to minimize the maximum profit that can be …

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 chapter explores models and algorithms applied to a class of Stackelberg games on
networks. In these network interdiction games, a network exists over which an operator …

A network interdiction problem usually involves two players who compete in a min-max or
max-min game. One player, the network owner, tries to optimize its objective over the …

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 …

This paper defines and studies the multi-terminal maximum-flow network-interdiction
problem (MTNIP) in which a network user attempts to maximize flow in a network among K⩾ …

The bilevel network‐interdiction problem (BNI) models the effective use of limited resources,
by an “interdictor,” to attack a network that an “enemy” may use to the interdictor's …

Suppose we are given a network G=(V, E) with arc distances and a linear cost function for
lengthening arcs. In this note, we consider a network‐interdiction problem in which the …

This paper discusses the development of interdiction optimization models and algorithms,
with an emphasis on mathematical programming techniques and future research challenges …

We describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-
flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) …