Now showing items 1-4 of 4
Robust facility location [Article]
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 ...
Generalized goal programming: polynomial methods and applications [Article]
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, ...
Dominating sets for convex functions with some applications [Article]
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 ...
Sum-of-squares clustering on networks [Article]
(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 ...