IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v30y2022i1d10.1007_s11750-021-00600-6.html
   My bibliography  Save this article

Interdicting facilities in tree networks

Author

Listed:
  • Nicolas Fröhlich

    (Technische Universität Kaiserslautern)

  • Stefan Ruzika

    (Technische Universität Kaiserslautern)

Abstract

This article investigates a network interdiction problem on a tree network: given a subset of nodes chosen as facilities, an interdictor may dissect the network by removing a size-constrained set of edges, striving to worsen the established facilities best possible. Here, we consider a reachability objective function, which is closely related to the covering objective function: the interdictor aims to minimize the number of customers that are still connected to any facility after interdiction. For the covering objective on general graphs, this problem is known to be NP-complete (Fröhlich and Ruzika In: On the hardness of covering-interdiction problems. Theor. Comput. Sci., 2021). In contrast to this, we propose a polynomial-time solution algorithm to solve the problem on trees. The algorithm is based on dynamic programming and reveals the relation of this location-interdiction problem to knapsack-type problems. However, the input data for the dynamic program must be elaborately generated and relies on the theoretical results presented in this article. As a result, trees are the first known graph class that admits a polynomial-time algorithm for edge interdiction problems in the context of facility location planning.

Suggested Citation

  • Nicolas Fröhlich & Stefan Ruzika, 2022. "Interdicting facilities in tree networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 95-118, April.
  • Handle: RePEc:spr:topjnl:v:30:y:2022:i:1:d:10.1007_s11750-021-00600-6
    DOI: 10.1007/s11750-021-00600-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-021-00600-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11750-021-00600-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Furini, Fabio & Ljubić, Ivana & Martin, Sébastien & San Segundo, Pablo, 2019. "The maximum clique interdiction problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 112-127.
    3. P. C. Gilmore & R. E. Gomory, 1966. "The Theory and Computation of Knapsack Functions," Operations Research, INFORMS, vol. 14(6), pages 1045-1074, December.
    4. Scaparra, Maria P. & Church, Richard L., 2008. "An exact solution approach for the interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 189(1), pages 76-92, August.
    5. Belarmino Adenso-Díaz & Julio Mar-Ortiz & Sebastián Lozano, 2018. "Assessing supply chain robustness to links failure," International Journal of Production Research, Taylor & Francis Journals, vol. 56(15), pages 5104-5117, August.
    6. Deniz Aksen & Nuray Piyade & Necati Aras, 2010. "The budget constrained r-interdiction median problem with capacity expansion," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(3), pages 269-291, September.
    7. Andrea Baggio & Margarida Carvalho & Andrea Lodi & Andrea Tramontani, 2021. "Multilevel Approaches for the Critical Node Problem," Operations Research, INFORMS, vol. 69(2), pages 486-508, March.
    8. Streib, Lucas & Kattwinkel, Mira & Heer, Henriette & Ruzika, Stefan & Schäfer, Ralf B., 2020. "How does habitat connectivity influence the colonization success of a hemimetabolous aquatic insect? - A modeling approach," Ecological Modelling, Elsevier, vol. 416(C).
    9. 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.
    10. Ramamoorthy, Prasanna & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2018. "Multiple allocation hub interdiction and protection problems: Model formulations and solution approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 230-245.
    11. Emilio Carrizosa & Stefan Nickel, 2003. "Robust facility location," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(2), pages 331-349, November.
    12. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    13. Kalcsics, Jörg & Nickel, Stefan & Pozo, Miguel A. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2014. "The multicriteria p-facility median location problem on networks," European Journal of Operational Research, Elsevier, vol. 235(3), pages 484-493.
    14. Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten, 2013. "Complexity of determining the most vital elements for the p-median and p-center location problems," Journal of Combinatorial Optimization, Springer, vol. 25(2), pages 191-207, February.
    15. Ghaffarinasab, Nader & Atayi, Reza, 2018. "An implicit enumeration algorithm for the hub interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 267(1), pages 23-39.
    16. Maryam Soleimani-Alyar & Alireza Ghaffari-Hadigheh & Fatemeh Sadeghi, 2016. "Controlling Floods by Optimization Methods," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 30(12), pages 4053-4062, September.
    Full references (including those not matched with items on IDEAS)

    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. Leitner, Markus & Ljubić, Ivana & Monaci, Michele & Sinnl, Markus & Tanınmış, Kübra, 2023. "An exact method for binary fortification games," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1026-1039.
    2. Bhuiyan, Tanveer Hossain & Medal, Hugh R. & Harun, Sarah, 2020. "A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption," European Journal of Operational Research, Elsevier, vol. 285(2), pages 670-694.
    3. 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.
    4. Parajuli, Anubhuti & Kuzgunkaya, Onur & Vidyarthi, Navneet, 2021. "The impact of congestion on protection decisions in supply networks under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    5. Ramamoorthy, Prasanna & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2018. "Multiple allocation hub interdiction and protection problems: Model formulations and solution approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 230-245.
    6. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    7. Sarhadi, Hassan & Tulett, David M. & Verma, Manish, 2017. "An analytical approach to the protection planning of a rail intermodal terminal network," European Journal of Operational Research, Elsevier, vol. 257(2), pages 511-525.
    8. Losada, Chaya & Scaparra, M. Paola & O’Hanley, Jesse R., 2012. "Optimizing system resilience: A facility protection model with recovery time," European Journal of Operational Research, Elsevier, vol. 217(3), pages 519-530.
    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. Ghaffarinasab, Nader & Atayi, Reza, 2018. "An implicit enumeration algorithm for the hub interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 267(1), pages 23-39.
    11. Yiyong Xiao & Pei Yang & Siyue Zhang & Shenghan Zhou & Wenbing Chang & Yue Zhang, 2020. "Dynamic Gaming Case of the R-Interdiction Median Problem with Fortification and an MILP-Based Solution Approach," Sustainability, MDPI, vol. 12(2), pages 1-17, January.
    12. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
    13. Ramamoorthy, Prasanna & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2016. "Hub Interdiction & Hub Protection problems: Model formulations & Exact Solution methods. (Revised)," IIMA Working Papers WP2016-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    14. Tanınmış, Kübra & Aras, Necati & Altınel, İ. Kuban, 2022. "Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks," European Journal of Operational Research, Elsevier, vol. 297(1), pages 40-52.
    15. Sachuer Bao & Chi Zhang & Min Ouyang & Lixin Miao, 2019. "An integrated tri-level model for enhancing the resilience of facilities against intentional attacks," Annals of Operations Research, Springer, vol. 283(1), pages 87-117, December.
    16. 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.
    17. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.
    18. Li, Qing & Li, Mingchu & Zhang, Runfa & Gan, Jianyuan, 2021. "A stochastic bilevel model for facility location-protection problem with the most likely interdiction strategy," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    19. Kosmas, Daniel & Sharkey, Thomas C. & Mitchell, John E. & Maass, Kayse Lee & Martin, Lauren, 2023. "Interdicting restructuring networks with applications in illicit trafficking," European Journal of Operational Research, Elsevier, vol. 308(2), pages 832-851.
    20. Xiang, Yin, 2023. "Minimizing the maximal reliable path with a nodal interdiction model considering resource sharing," Reliability Engineering and System Safety, Elsevier, vol. 239(C).

    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:spr:topjnl:v:30:y:2022:i:1:d:10.1007_s11750-021-00600-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.