RT journal article
T1 Minmax regret maximal covering location problems with edge demands
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 Minmax regret
K1 Networks
K1 Robust optimization
AB This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem, we propose a minmax regret model where the service facility can be located anywhere along the network. This problem is called Minmax Regret Maximal Covering Location Problem with demand distributed along the edges (MMR-EMCLP). Furthermore, we present two polynomial algorithms for finding the location that minimises the maximal regret assuming that the demand realisation is an unknown constant or linear function on each edge. We also include two illustrative examples as well as a computational study for the unknown constant demand case to illustrate the potential and limits of the proposed methodology.
PB Elsevier
SN 0305-0548
YR 2021
FD 2021
LK http://hdl.handle.net/10498/33311
UL http://hdl.handle.net/10498/33311
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026