Buscar
Mostrando ítems 1-2 de 2
Artículo
A discretizing algorithm for location problems
(ELSEVIER SCIENCE BV, 1995)
A new and simple methodology is proposed to solve both constrained and unconstrained planar continuous single-facility location problems. As particular instances, the classical location problems with mixed gauges can be ...
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 ...