Buscar
Mostrando ítems 1-1 de 1
Artículo
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
(Springer, 1998-12-01)
A location is sought within some convex region of the plane for the central site of some public service to a finite number of demand points. The parametric maxcovering problem consists in finding for eachR>0 the point from ...