Connecting measures by means of branched transportation networks at finite cost

DOI10.1007/S10958-009-9362-XzbMATH Open1219.49039OpenAlexW1969988344MaRDI QIDQ613754FDOQ613754

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

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

Cites Work

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

Cited In (4)

• Fractal regularity results on optimal irrigation patterns
• Improved stability of optimal traffic paths
• Strong approximation in \(h\)-mass of rectifiable currents under homological constraint
• The structure of branched transportation networks

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

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