Given the probability measure $\nu$ over the given region $\Omega \subset {ℝ}^n$, we consider the optimal location of a set $\Sigma$ composed by $n$ points in $\Omega$ in order to minimize the average distance $\Sigma \mapsto {\int }_{\Omega }\mathrm{dist}(x,\Sigma )\mathrm{d}\nu$ (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists 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 adding at each step at most one point and preserving...

Given the probability measure ν over the given region $\Omega \subset {ℝ}^n$, we consider the optimal location of a set Σ composed by n points in Ω in order to minimize the average distance $\Sigma \mapsto {\int }_{\Omega }\mathrm{dist}(x,\Sigma )\mathrm{d}\nu$ (the classical optimal facility location problem). The paper compares two strategies to find optimal configurations: the long-term one which consists 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 adding at each step at most one point and preserving...