We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Given the probability measure ν over the given region $\Omega\subset \mathbb{R}^n$ 
, we consider the optimal location of a setΣ composed by n points in Ω in order to minimize theaverage distance $\Sigma\mapsto \int_\Omega \mathrm{dist}\,(x,\Sigma)\,{\rm d}\nu$ 
(theclassical optimal facility location problem). The paper compares twostrategies to find optimal configurations: the long-term one whichconsists in placing all n points at once in an optimal position, and the short-term one which consists in placing the points one by one addingat each step at most one point and preserving the configurationbuilt at previous steps. We show that the respective optimizationproblems exhibit qualitatively different asymptotic behavior as $n\to\infty$ 
, although the optimization costs in both cases have the same asymptotic orders of vanishing.
