This article is a US Government work and, as such, is in the public domain in the United States of America.
Shortest-path network interdiction†
Article first published online: 5 AUG 2002
Copyright © 2002 Wiley Periodicals, Inc.
Volume 40, Issue 2, pages 97–111, September 2002
How to Cite
Israeli, E. and Wood, R. K. (2002), Shortest-path network interdiction. Networks, 40: 97–111. doi: 10.1002/net.10039
- Issue published online: 5 AUG 2002
- Article first published online: 5 AUG 2002
- Manuscript Accepted: MAY 2002
- Manuscript Received: JUL 1999
- Office of Naval Research
- Air Force Office of Scientific Research
- shortest paths;
- bilevel program;
- Benders decomposition
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. One algorithm enhances Benders decomposition by adding generalized integer cutting planes, called “supervalid inequalities” (SVIs), to the master problem. A second algorithm exploits a unique set-covering master problem. Computational results demonstrate orders-of-magnitude improvements of the decomposition algorithms over direct solution of the MIP and show that SVIs also help solve the original MIP faster. Published 2002 Wiley Periodicals, Inc.