On the well-posedness of branched transportation
arXiv:1904.03683
Abstract
We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book Optimal transportation networks, by Bernot, Caselles and Morel), which has been addressed up to now only under restrictive assumptions.
References in corpus (7)
- Decomposition of acyclic normal currents in a metric space
- Approximation of length minimization problems among compact connected sets
- The Steiner tree problem revisited through rectifiable G-currents
- On the lower semicontinuous envelope of functionals defined on polyhedral chains
- 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