Show simple item record

dc.contributor.authorIsraeli, E.
dc.contributor.authorWood, R.K.
dc.date2002
dc.date.accessioned2013-09-25T23:03:09Z
dc.date.available2013-09-25T23:03:09Z
dc.date.issued2002
dc.identifier.citationIsraeli, E. and Wood, R.K., 2002, “Shortest‐Path Network Interdiction,” Networks, 40, pp. 97‐111.
dc.identifier.urihttp://hdl.handle.net/10945/36721
dc.descriptionNetworks, 40, pp. 97‐111.en_US
dc.description.abstractWe 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.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.titleShortest‐Path Network Interdictionen_US
dc.contributor.departmentDepartment of Operations Research
dc.subject.authorNetwork Interdiction and Attacker-Defender Modelingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record