An optimal irrigation network with infinitely many branching points
- 24 March 2016
- journal article
- research article
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 22 (2) , 543-561
Abstract
The Gilbert−Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the “flow”. In this paper, we introduce a new formulation of the problem, which turns it into the minimization of a convex functional in a class of currents with coefficients in a group. This framework allows us to define calibrations. We apply this technique to prove the optimality of a certain irrigation network in the separable Hilbert space ℓ 2, having countably many branching points and a continuous amount of endpoints.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Existence and regularity results for the Steiner problemCalculus of Variations and Partial Differential Equations, 2012
- An equivalent path functional formulation of branched transportation problemsDiscrete and Continuous Dynamical Systems, 2011
- The formation of a tree leafESAIM: Control, Optimisation and Calculus of Variations, 2007
- Optimal transportation networks as flat chainsInterfaces and Free Boundaries, Mathematical Analysis, Computation and Applications, 2006
- Path Functionals over Wasserstein SpacesJournal of the European Mathematical Society, 2006
- Interior regularity of optimal transport pathsCalculus of Variations and Partial Differential Equations, 2004
- An optimal bronchial tree may be dangerousNature, 2004
- A variational model of irrigation patternsInterfaces and Free Boundaries, Mathematical Analysis, Computation and Applications, 2003
- Rectifiability of Flat ChainsAnnals of Mathematics, 1999
- Harmonic maps with defectsCommunications in Mathematical Physics, 1986