Shortest‐Path Network Interdiction
MetadataShow full item record
We study the problem of interdicting the arcs in a net- work 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 inter- diction budget. We formulate this bilevel, max–min prob- lem as a mixed-integer program (MIP), which can be solved directly, but we develop more efficient decompo- sition algorithms. One algorithm enhances Benders de- composition 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.
Networks, 40, pp. 97‐111.
Showing items related by title, author, creator and subject.
Agrawal, B.N. (1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ...
Schwartz, Garry S. (Monterey, California. Naval Postgraduate School, 1993-03);This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations ...
On partitioning an arbitrarily given set of elements of a finite Boolean algebra into the minimum number of sets of compatible elements Colwell, Samuel C., III (Monterey, California. Naval Postgraduate School, 1964);During the past several years at the United States Naval Postgraduate School there has been much interest in obtaining an efficient method for making a time schedule for classes. A mathematical model for a simplified ...