IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v52y2005i4p321-328.html
   My bibliography  Save this article

A decomposition algorithm applied to planning the interdiction of stochastic networks

Author

Listed:
  • Harald Held
  • Raymond Hemmecke
  • David L. Woodruff

Abstract

We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267–287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.

Suggested Citation

  • Harald Held & Raymond Hemmecke & David L. Woodruff, 2005. "A decomposition algorithm applied to planning the interdiction of stochastic networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 321-328, June.
    • Handle: RePEc:wly:navres:v:52:y:2005:i:4:p:321-328
    DOI: 10.1002/nav.20079
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20079
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20079?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kelly J. Cormican & David P. Morton & R. Kevin Wood, 1998. "Stochastic Network Interdiction," Operations Research, INFORMS, vol. 46(2), pages 184-197, April.
    2. Bruce Golden, 1978. "A problem in network interdiction," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(4), pages 711-713, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Juan S. Borrero & Oleg A. Prokopyev & Denis Sauré, 2019. "Sequential Interdiction with Incomplete Information and Learning," Operations Research, INFORMS, vol. 67(1), pages 72-89, January.
    2. Enayaty-Ahangar, Forough & Rainwater, Chase E. & Sharkey, Thomas C., 2019. "A Logic-based Decomposition Approach for Multi-Period Network Interdiction Models," Omega, Elsevier, vol. 87(C), pages 71-85.
    3. Yongjia Song & Siqian Shen, 2016. "Risk-Averse Shortest Path Interdiction," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 527-539, August.
    4. Alper Atamtürk & Carlos Deck & Hyemin Jeon, 2020. "Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 346-355, April.
    5. Paola Cappanera & Maria Paola Scaparra, 2011. "Optimal Allocation of Protective Resources in Shortest-Path Networks," Transportation Science, INFORMS, vol. 45(1), pages 64-80, February.
    6. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
    7. Brian Lunday & Hanif Sherali, 2012. "Network interdiction to minimize the maximum probability of evasion with synergy between applied resources," Annals of Operations Research, Springer, vol. 196(1), pages 411-442, July.
    8. Kaiyue Zheng & Laura A. Albert, 2019. "Interdiction models for delaying adversarial attacks against critical information technology infrastructure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(5), pages 411-429, August.
    9. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    10. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    11. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    2. Nguyen, Di H. & Smith, J. Cole, 2022. "Network interdiction with asymmetric cost uncertainty," European Journal of Operational Research, Elsevier, vol. 297(1), pages 239-251.
    3. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    4. Bloch, Francis & Chatterjee, Kalyan & Dutta, Bhaskar, 2023. "Attack and interception in networks," Theoretical Economics, Econometric Society, vol. 18(4), November.
    5. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
    6. Noam Goldberg, 2017. "Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 139-153, March.
    7. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
    8. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    9. Sushil Gupta & Martin K. Starr & Reza Zanjirani Farahani & Mahsa Mahboob Ghodsi, 2020. "Prevention of Terrorism–An Assessment of Prior POM Work and Future Potentials," Production and Operations Management, Production and Operations Management Society, vol. 29(7), pages 1789-1815, July.
    10. Young‐Soo Myung & Hyun‐Joon Kim, 2007. "Network disconnection problems in a centralized network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(7), pages 710-719, October.
    11. Brian Lunday & Hanif Sherali, 2012. "Network interdiction to minimize the maximum probability of evasion with synergy between applied resources," Annals of Operations Research, Springer, vol. 196(1), pages 411-442, July.
    12. Claudio Contardo & Jorge A. Sefair, 2022. "A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 890-908, March.
    13. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
    14. Shahram Morowati-Shalilvand & Sedaghat Shahmorad & Kamal Mirnia & Javad Mehri-Tekmeh, 2021. "Quickest flow over time network interdiction: mathematical formulation and a solution method," Operational Research, Springer, vol. 21(2), pages 1179-1209, June.
    15. Kosanoglu, Fuat & Bier, Vicki M., 2020. "Target-oriented utility for interdiction of transportation networks," Reliability Engineering and System Safety, Elsevier, vol. 197(C).
    16. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    17. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.
    18. Alan T. Murray & Timothy C. Matisziw & Tony H. Grubesic, 2008. "A Methodological Overview of Network Vulnerability Analysis," Growth and Change, Wiley Blackwell, vol. 39(4), pages 573-592, December.
    19. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    20. Johannes O. Royset & R. Kevin Wood, 2007. "Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 175-184, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:52:y:2005:i:4:p:321-328. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.