Connecting measures by means of branched transportation networks at finite cost

DOI10.1007/S10958-009-9362-XMaRDI QIDQ613754zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The structure of branched transportation networks
• Irrigable measures for weighted irrigation plans
• A multi-material transport problem with arbitrary marginals
• Optimal transportation networks as free Dirichlet for the Monge-Kantorovich problem
• General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary

Cites work

• scientific article; zbMATH DE number 41015 (Why is no real title available?)
• scientific article; zbMATH DE number 1996421 (Why is no real title available?)
• scientific article; zbMATH DE number 1448982 (Why is no real title available?)
• scientific article; zbMATH DE number 3280855 (Why is no real title available?)
• A variational model of irrigation patterns
• Are there infinite irrigation trees?
• Comparison of distances between measures
• Interior regularity of optimal transport paths
• Low cost drainage networks
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• On the dimension of an irrigable measure
• Optimal Design of Gas Pipeline Networks
• Optimal channel networks, landscape function and branched transport
• Optimal transportation networks as flat chains
• Rectifiability of flat chains
• The structure of branched transportation networks
• Traffic plans

Cited in

(4)

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

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)