@misc{10498/31364,
year = {2017},
url = {http://hdl.handle.net/10498/31364},
abstract = {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.},
publisher = {Elsevier},
keywords = {Discrete location},
keywords = {p-center},
keywords = {Mixed integer linear formulations},
keywords = {Demand uncertainty},
title = {The probabilistic p-center problem: Planning service for potential customers},
doi = {10.1016/j.ejor.2017.03.043},
author = {Martínez Merino, Luisa Isabel and Albareda-Sambola, Maria and Rodríguez Chía, Antonio Manuel},
}