RT journal article
T1 Edge downgrades in the maximal covering location problem
A1 Baldomero Naranjo, Marta
A1 Kalcsics, Jörg
A1 Rodríguez Chía, Antonio Manuel
A2 Estadística e Investigación Operativa
K1 Location
K1 Covering
K1 Bilevel optimization
K1 Downgrading
AB 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 determine the location of facilities to maximize the covered demand while anticipating that an attacker will attempt to reduce coverage by increasing the length of some edges (downgrade); (b) The attacker seeks to maximize the demand initially covered by the facilities but left uncovered after the downgrade. The attacker can increase the length of certain edges within a specified budget.We introduce a mixed-integer linear bilevel program to formulate the problem, followed by a preprocessing phase and a matheuristic algorithm designed to address it. Additionally, computational results are presented to illustrate the potential and limitations of the proposed algorithm.
PB Elsevier
SN 0305-0548
YR 2025
FD 2025
LK http://hdl.handle.net/10498/35706
UL http://hdl.handle.net/10498/35706
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 10-nov-2026