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
Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
(Springer, 1998-01-01)
In this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle (the facility) minimizing the average distance to a given set (the demand-set) which is not assumed ...