Buscar
Mostrando ítems 1-3 de 3
Artículo
Solving nonconvex planar location problems by nite dominating sets
(Springer, 2000-10)
It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one ...
Artículo
A fractional model for locating semi-desirable facilities on networks
(ELSEVIER SCIENCE BV, 2002-01-01)
In this paper, we address the problem of locating a series of facilities on a network maximizing the average distance to population centers (assumed to be distributed in the plane) per unit transportation cost (a function ...
Artículo
On the exponential cardinality of FDS for the ordered p-median problem
(Elsevier, 2005)
We study finite dominating sets (FDS) for the ordered median problem. This kind of problems allows to deal simultaneously with a large number of models. We show that there is no valid polynomial size FDS for the general ...