Buscar
Mostrando ítems 1-2 de 2
Artículo
Locating an undesirable facility by generalized cutting planes
(Informs, 1998-08-03)
We address the problem of locating an undesirable facility within a compact set by minimizing a strictly decreasing boundedly lower subdifferentiable function of the squared Euclidean distances to a set of fixed points. ...
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 ...