2 papers
math.OC2025
Edge downgrades in the maximal covering location problem
Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. RodrÃguez-ChÃa
We tackle the downgrading maximal covering location problem within a network. In this problem, two actors with conflicting objectives are involved: (a) The location planner aims to…
cs.DS2024
On the complexity of the upgrading version of the maximal covering location problem
Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. RodrÃguez-ChÃa
In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on ge…