RT journal article
T1 The probabilistic p-center problem: Planning service for potential customers
A1 Martínez Merino, Luisa Isabel
A1 Albareda-Sambola, Maria
A1 Rodríguez Chía, Antonio Manuel
A2 Estadística e Investigación Operativa
K1 Discrete location
K1 p-center
K1 Mixed integer linear formulations
K1 Demand uncertainty
AB This work deals with the probabilistic p-center problem, which aims at minimizing the expected maximum distance between any site with demand and its center, considering that each site has demand with a specific probability. The problem is of interest when emergencies may occur at predefined sites with known probabilities. For this problem we propose and analyze different formulations as well as a Variable Neighborhood Search heuristic. Computational tests are reported, showing the potentials and limits of each formulation, the impact of their enhancements, and the effectiveness of the heuristic.
PB Elsevier
SN 0377-2217
YR 2017
FD 2017
LK http://hdl.handle.net/10498/31364
UL http://hdl.handle.net/10498/31364
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026