  This paper introduces a very general discrete covering location model that
accounts for uncertainty and time-dependent aspects. A MILP formulation is
proposed for the problem. Afterwards, it is observed that most of the models
existing in the literature related with covering location can be considered as
particular cases of this formulation. In order to tackle large instances of
this problem a Lagrangian relaxation based heuristic is developed. A
computational study is addressed to check the potentials and limits of the
formulation and some variants proposed for the problem, as well as to evaluate
the heuristic. Finally, different measures to report the relevance of
considering a multi-period stochastic setting are studied.
