AN OPTIMAL IRRIGATION NETWORK WITH INFINITELY MANY BRANCHING POINTS

作者:Marchese Andrea*; Massaccesi Annalisa*
来源:ESAIM: Control, Optimisation and Calculus of Variations , 2016, 22(2): 543-561.
DOI:10.1051/cocv/2015028

摘要

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 l(2), having countably many branching points and a continuous amount of endpoints.

  • 出版日期2016-6