An exact approach for the \(r\)-interdiction covering problem with fortification
type: Item
instance of: scholarly article
title: An exact approach for the \(r\)-interdiction covering problem with fortification
author: Marcos Costa Roboredo
author: Luiz Aizemberg
author: Artur Alves Pessoa
published in: CEJOR. Central European Journal of Operations Research
publication date: 2019-02-15T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7024042
zbMATH Keywords: integer programming
zbMATH Keywords: branch-and-cut algorithm
zbMATH Keywords: \(r\)-interdiction covering problem with fortification
MaRDI profile type: Publication
full work available at URL: s10100-017-0494-7
OpenAlex ID: W2762761374
cites work: The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
cites work: A defensive maximal covering problem on a network
cites work: PROTECTION STRATEGIES FOR CRITICAL RETAIL FACILITIES : APPLYING INTERDICTION MEDIAN AND MAXIMAL COVERING PROBLEMS WITH FORTIFICATION
cites work: Interdiction Games and Monotonicity, with Application to Knapsack Problems
cites work: Shortest-path network interdiction
cites work: Incorporating the threat of terrorist attacks in the design of public service facility networks
cites work: Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
cites work: Designing robust coverage networks to hedge against worst-case facility losses
cites work: A hybrid method for the probabilistic maximal covering location-allocation problem
cites work: A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
cites work: A bilevel mixed-integer program for critical infrastructure protection planning
cites work: An exact solution approach for the interdiction median problem with fortification
DOI: 10.1007/S10100-017-0494-7
description: scientific article; zbMATH DE number 7024042