Buscar
Mostrando ítems 1-2 de 2
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
Robust facility location
(Springer, 2003-11)
Let A be a nonempty finite subset of the plane representing the geographical coordinates of a set of demand points (towns, …), to be served by a facility, whose location within a given region S is sought. Assuming that the ...