Resumen de Planar maximal covering problems in a multimodal transportation environment
Frank Plastria 
, Emilio Carrizosa Priego
We consider a maximal covering location problem in the plane, in which shortest paths are obtained by combining planar (Euclidean) routes with the distance between interconnection points by alternative transportation systems.
The set of candidate locations is reduced to a discrete set, which is indepen- dent of the covering radius. This enables us to perform full parametric analysis in the radius.
