An optimal irrigation network with infinitely many branching points

DOI10.1051/COCV/2015028zbMATH Open1343.49074arXiv1408.2406OpenAlexW2082053483MaRDI QIDQ2808058FDOQ2808058

Andrea Marchese, Annalisa Massaccesi

Publication date: 26 May 2016

Published in: European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations (Search for Journal in Brave)

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, which can be used to prove the optimality of concrete configurations. We apply this technique to prove the optimality of a certain irrigation network, having the topological property mentioned in the title.

Full work available at URL: https://arxiv.org/abs/1408.2406

zbMATH Keywords

calibrationsbranching pointsGilbert-Steiner problemflat \(G\)-chainsirrigation network

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Regularity of solutions in optimal control (49N60) Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Calibrations and calibrated geometries (53C38)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Currents in metric spaces
• Harmonic maps with defects
• A variational model of irrigation patterns
• Interior regularity of optimal transport paths
• Traffic plans
• Synchronic and asynchronic descriptions of irrigation problems
• Optimal networks for mass transportation problems
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• Title not available (Why is that?)
• An equivalent path functional formulation of branched transportation problems
• The regularity of optimal irrigation patterns
• Path functionals over Wasserstein spaces
• Optimal transportation networks. Models and theory
• Optimal Design of Gas Pipeline Networks
• Minimum Concave Cost Flows in Certain Networks
• Existence and regularity results for the Steiner problem
• The formation of a tree leaf
• The Steiner problem for infinitely many points
• Rectifiable and flat \(G\) chains in a metric space
• Rectifiability of flat chains
• Modeling of dislocations and relaxation of functionals on 1-currents with discrete multiplicity
• Optimal transportation networks as flat chains
• Are there infinite irrigation trees?
• The Steiner tree problem revisited through rectifiable \(G\)-currents
• An example of an infinite Steiner tree connecting an uncountable set

Cited In (13)

• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• Self-similar minimizers of a branched transport functional
• A multi-material transport problem with arbitrary marginals
• Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets
• Coefficient groups inducing nonbranched optimal transport
• Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\)
• Stability for the mailing problem
• Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
• Improved stability of optimal traffic paths
• Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks
• A convex approach to the Gilbert-Steiner problem
• The oriented mailing problem and its convex relaxation
• A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents

This page was built for publication: An optimal irrigation network with infinitely many branching points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808058)