Connecting measures by means of branched transportation networks at finite cost

DOI10.1007/s10958-009-9362-xzbMath1219.49039OpenAlexW1969988344MaRDI QIDQ613754

Eugene Stepanov, Emmanuele Paolini

Publication date: 22 December 2010

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-009-9362-x

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Variational problems in a geometric measure-theoretic setting (49Q20) Classical measure theory (28A99)

Related Items (3)

Improved stability of optimal traffic paths ⋮ Fractal regularity results on optimal irrigation patterns ⋮ Strong approximation in \(h\)-mass of rectifiable currents under homological constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal transportation networks as flat chains
• The structure of branched transportation networks
• Comparison of distances between measures
• A variational model of irrigation patterns
• Rectifiability of flat chains
• Interior regularity of optimal transport paths
• Optimal channel networks, landscape function and branched transport
• On the dimension of an irrigable measure
• Are there infinite irrigation trees?
• Traffic plans
• Optimal Design of Gas Pipeline Networks
• Low cost drainage networks
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS

This page was built for publication: Connecting measures by means of branched transportation networks at finite cost