Volume 53, Number 2, April-June 2019
|Page(s)||505 - 516|
|Published online||07 May 2019|
An exact approach for the r-interdiction median problem with fortification
Production Engineering Department, Federal Fluminense University, R. Passo da Pátria, 156, 24210-240, São Domingos, Niterói, RJ, Brazil
2 BNDES, Brazilian Development Bank, Avenida República do Chile, 100, 20031-917, Rio de Janeiro, RJ, Brazil
* Corresponding author: firstname.lastname@example.org
Accepted: 23 July 2017
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.
Mathematics Subject Classification: 90C10 / 90C11 / 90C27 / 90C47 / 90C57 / 90B06 / 90B80
Key words: Bilevel Programming / Branch-and-cut / The r-interdiction median problem with fortification
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.