Buscar
Mostrando ítems 1-5 de 5
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
Locating a semi-obnoxious covering facility with repelling polygonal regions
(ELSEVIER SCIENCE BV, 2013-11-01)
A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is ...
Artículo
On minimax-regret Huff location models
(Elsevier, 2011-01)
We address the following single-facility location problem: a firm is entering into a market by locating one facility in a region of the plane. The demand captured from each user by the facility will be proportional to the ...
Artículo
Weber problems with alternative transportation systems
(ELSEVIER SCIENCE BV, 1997-02-16)
In this paper we address a planar p-facility location problem where, together with a metric induced by a gauge, there exists a series of rapid transit lines, which can be used as alternative transportation system to reduce ...
Artículo
Continuous location problems and Big Triangle Small Triangle: constructing better bounds
(Springer, 2009-11)
The Big Triangle Small Triangle method has shown to be a powerful global optimization procedure to address continuous location problems. In the paper published in J. Global Optim. (37:305–319, 2007), Drezner proposes a ...