TY  - GEN 
AU  - Baldomero Naranjo, Marta
AU  - Kalcsics, Jörg
AU  - Rodríguez Chía, Antonio Manuel
A4  - Estadística e Investigación Operativa
PY  - 2024
SN  - 0028-304
UR  - http://hdl.handle.net/10498/31336
AB  - 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 general networks. However, in some particular cases, we prove that this...
LA  - eng
PB  - Wiley
KW  - complexity
KW  - covering problems
KW  - location
KW  - networks
KW  - upgrading problems
TI  - On the complexity of the upgrading version of the maximal covering location problem
DO  - 10.1002/net.22207
ER  -