An exact approach for the r-interdiction covering problem with fortification

Marcos Costa Roboredo (), Luiz Aizemberg () and Artur Alves Pessoa ()
Additional contact information
Marcos Costa Roboredo: Universidade Federal Fluminense
Luiz Aizemberg: Banco Nacional do Desenvolvimento
Artur Alves Pessoa: Universidade Federal Fluminense

Central European Journal of Operations Research, 2019, vol. 27, issue 1, No 6, 131 pages

Abstract: Abstract In this paper we treat the r-interdiction covering problem with fortification (RICF). The environment of this problem is composed of a set of customers J and a set of facilities I. For each customer j, there is set of facilities containing the facilities that can cover the demand of j. The system efficiency is given by the sum of the total covered demand. The facilities are subject to interdictions. When a facility is interdicted, it can not cover the demand of any customer. To mitigate the negative impact of the interdictions on the system efficiency, the system planner can fortify a subset of facilities. If a facility is fortified then it can not be interdicted. The RICF consists of choosing q facilities to be fortified knowing that r not fortified facilities will be interdicted at the worst case. We propose a branch-and-cut algorithm for the problem. Our results are compared with the exact method found in the literature, being faster for the most instances, mainly the large ones.

Keywords: Integer programming; Branch-and-cut algorithm; r-Interdiction covering problem with fortification (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10100-017-0494-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:27:y:2019:i:1:d:10.1007_s10100-017-0494-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-017-0494-7

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from 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
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().