{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:04Z","timestamp":1759667704307,"version":"3.37.3"},"reference-count":25,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:00:00Z","timestamp":1557187200000},"content-version":"vor","delay-in-days":36,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2017,7,23]]},"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p>We study the r-interdiction median problem with fortification (RIMF), which considers demand points that are served by facilities. If a facility is interdicted, it can not serve any demand point, increasing the total system cost. To avoid an interdiction, a facility can be fortified. The problem consists of fortifying facilities knowing that some facilities will be interdicted. We propose a branch-and-cut algorithm for the RIMF and several experiments attest that our method outperforms the best exact algorithm found.<\/jats:p>","DOI":"10.1051\/ro\/2017060","type":"journal-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T06:55:27Z","timestamp":1500965727000},"page":"505-516","source":"Crossref","is-referenced-by-count":5,"title":["An exact approach for the r-interdiction median problem with fortification"],"prefix":"10.1051","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2398-5207","authenticated-orcid":false,"given":"Marcos Costa","family":"Roboredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur Alves","family":"Pessoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz","family":"Aizemberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,5,7]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10100-009-0110-6","volume":"18","author":"Aksen","year":"2010","journal-title":"Central Europ. J. Oper. Res."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Alderson D.L., Brown G.G., and Carlyle W.M., Assessing and improving operational resilience of critical infrastructures and other systems. INFORMS Tutorials in Operations Research. Bridging Data and Decisions (2014) 180\u2013215.","DOI":"10.1287\/educ.2014.0131"},{"key":"R3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"Alp","year":"2003","journal-title":"Ann. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/1520-6750(199204)39:3<419::AID-NAV3220390310>3.0.CO;2-C","volume":"39","author":"Bard","year":"1992","journal-title":"Naval Research Logistics"},{"key":"R5","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/inte.1060.0252","volume":"36","author":"Brown","year":"2006","journal-title":"Interfaces"},{"key":"R6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1111\/j.1538-4632.2007.00698.x","volume":"39","author":"Church","year":"2007","journal-title":"Geographical Anal."},{"key":"R7","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","volume":"94","author":"Church","year":"2004","journal-title":"Ann. Association Amer. Geographers"},{"key":"R8","unstructured":"Department of Homeland Security of the United States. Available at: https:\/\/www.dhs.gov\/critical-infrastructure-sectors https:\/\/www.dhs.gov\/critical-infrastructure-sectors (2019)."},{"key":"R9","unstructured":"Goodchild M.F. and Noronha V.T., Location-allocation for small computers. Department of Geography, University of Iowa (1983)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","volume":"40","author":"Israeli","year":"2002","journal-title":"Networks"},{"key":"R11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1111\/gean.12006","volume":"45","author":"Lei","year":"2013","journal-title":"Geographical Anal."},{"key":"R12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.cor.2010.06.002","volume":"38","author":"Liberatore","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.omega.2011.03.003","volume":"40","author":"Liberatore","year":"2012","journal-title":"Omega"},{"key":"R14","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.ejor.2011.09.044","volume":"217","author":"Losada","year":"2012","journal-title":"Europ. J. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38","author":"Moore","year":"1990","journal-title":"Oper. Res."},{"key":"R16","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.cor.2016.05.005","volume":"75","author":"Nandi","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2010.08.030","volume":"209","author":"O\u2019Hanley","year":"2011","journal-title":"Europ. J. Oper. Res."},{"key":"R18","unstructured":"Passmark software. Available at: https:\/\/www.cpubenchmark.net (2019)."},{"key":"R19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ejor.2012.07.042","volume":"224","author":"Roboredo","year":"2013","journal-title":"Europ. J. Operat. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s12198-014-0152-4","volume":"8","author":"Sarhadi","year":"2015","journal-title":"J. Trans. Security"},{"key":"R21","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ejor.2007.05.027","volume":"189","author":"Scaparra","year":"2008","journal-title":"Europ. J. Oper. Res."},{"key":"R22","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1016\/j.cor.2006.09.019","volume":"35","author":"Scaparra","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/0740817X.2015.1067735","volume":"48","author":"Snyder","year":"2016","journal-title":"IIE Trans."},{"key":"R24","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.disopt.2009.05.004","volume":"6","author":"Taskn","year":"2009","journal-title":"Discrete Optim."},{"key":"R25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ress.2013.08.003","volume":"121","author":"Yuan","year":"2014","journal-title":"Reliability Eng. Syst. Safety"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017060\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:47:39Z","timestamp":1584690459000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":25,"journal-issue":{"issue":"2"},"alternative-id":["ro160124"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2017060","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}