Long-term planning versus short-term planning in the asymptotical location problem

Abstract

Given the probability measure $\nu$ over the given region $\Omega \subset {\mathbb{R}}^n$, we consider the optimal location of a set $\Sigma$ composed by $n$ points $\Om$ in order to minimize the average distance $Σ\mapsto \int_\Om \dist(x,Σ) dν$ (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 the configuration built at previous steps. We show that the respective optimization problems exhibit qualitatively different asymptotic behavior as $n\to \infty$, although the optimization costs in both cases have the same asymptotic orders of vanishing.

for more pictures and some movies as well, see http://www.sissa.it/~brancoli/

References in corpus (2)

• A model for the quasi-static growth of brittle fractures: existence and approximation results
• Long-term planning versus short-term planning in the asymptotical location problem

Cited by in corpus (8)

• Long-term planning versus short-term planning in the asymptotical location problem
• Equivalent formulations for the branched transport and urban planning problems
• On the Lagrangian branched transport model and the equivalence with its Eulerian formulation
• Optimal micropatterns in 2D transport networks and their relation to image inpainting
• Optimal micropatterns in transport networks
• Formulation of branched transport as geometry optimization
• An optimal irrigation network with infinitely many branching points
• Sparsity for dynamic inverse problems on Wasserstein curves with bounded variation