An exact approach for the \(r\)-interdiction covering problem with fortification
From MaRDI portal
Publication:1725826
DOI10.1007/s10100-017-0494-7OpenAlexW2762761374MaRDI QIDQ1725826
Luiz Aizemberg, Artur Alves Pessoa, Marcos Costa Roboredo
Publication date: 15 February 2019
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-017-0494-7
Related Items (3)
A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
Cites Work
- A hybrid method for the probabilistic maximal covering location-allocation problem
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- Designing robust coverage networks to hedge against worst-case facility losses
- Incorporating the threat of terrorist attacks in the design of public service facility networks
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- A bilevel mixed-integer program for critical infrastructure protection planning
- An exact solution approach for the interdiction median problem with fortification
- A defensive maximal covering problem on a network
- Shortest-path network interdiction
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- PROTECTION STRATEGIES FOR CRITICAL RETAIL FACILITIES : APPLYING INTERDICTION MEDIAN AND MAXIMAL COVERING PROBLEMS WITH FORTIFICATION
This page was built for publication: An exact approach for the \(r\)-interdiction covering problem with fortification
