Buscar
Mostrando ítems 1-7 de 7
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 ...
Artículo
El conjunto eficiente en problemas de localización con normas mixtas (L p)
(Sociedad Española de Estadística e Investigación Operativa, 1991-12-18)
En el presente trabajo establecemos una nueva aproximación a la solución del problema de localización con normas mixtas a través de lasdirecciones de proyección. Probamos que el cierre octogonal de los puntos de demanda ...
Artículo
Dominating sets for convex functions with some applications
(Springer, 1998-02)
A number of optimization methods require as a rst step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem ...
Artículo
Solving multifacility Huff location models on networks using metaheuristic and exact approaches
(PERGAMON-ELSEVIER SCIENCE LTD, 2016-03-16)
In this paper we consider multifacility Huff facility location problem on networks. First, we introduce a slight modification of the existing mixed integer nonlinear mathematical model and confirm its validity by using the ...
Artículo
Generalized goal programming: polynomial methods and applications
(Springer, 2002-12)
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, ...
Artículo
Sum-of-squares clustering on networks
(University of Belgrade, 2011)
Finding p prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in clustering, data analysis and continuous location. In this note, this very ...