Buscar
Mostrando ítems 1-2 de 2
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 ...
Artículo
Undesirable facility location with minimal covering objectives
(ELSEVIER SCIENCE BV, 1999-11-19)
An undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into ...