A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents

DOI10.1137/17M1162858zbMath1422.49040arXiv1712.08942OpenAlexW2964110112MaRDI QIDQ5231299

Annalisa Massaccesi, Riccardo Tione, Andrea Marchese

Publication date: 26 August 2019

Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

rectifiable currentscalibrationsbranched transportationmultimaterial transport problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Variational problems in a geometric measure-theoretic setting (49Q20) Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Optimization of shapes other than minimal surfaces (49Q10) Calibrations and calibrated geometries (53C38)

Related Items (4)

A multi-material transport problem with arbitrary marginals ⋮ Generic uniqueness of optimal transportation networks ⋮ The oriented mailing problem and its convex relaxation ⋮ Convex Relaxation of Discrete Vector-Valued Optimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalent formulations for the branched transport and urban planning problems
• Fractal regularity results on optimal irrigation patterns
• A Modica-Mortola approximation for branched transport and applications
• Modeling of dislocations and relaxation of functionals on 1-currents with discrete multiplicity
• A multi-material transport problem with arbitrary marginals
• The regularity of optimal irrigation patterns
• Elementary properties of optimal irrigation patterns
• Path functionals over Wasserstein spaces
• The Steiner tree problem revisited through rectifiable \(G\)-currents
• The structure of branched transportation networks
• Absolute and monotonic norms
• A variational model of irrigation patterns
• The deformation theorem for flat chains
• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
• Improved stability of optimal traffic paths
• Numerical calibration of Steiner trees
• A phase-field approximation of the Steiner problem in dimension two
• Rectifiability of flat chains
• Interior regularity of optimal transport paths
• Stability for the mailing problem
• On the lower semicontinuous envelope of functionals defined on polyhedral chains
• On the dimension of an irrigable measure
• An optimal irrigation network with infinitely many branching points
• Rectifiable and flat <i>G</i> chains in a metric space
• Boundary regularity of optimal transport paths
• A Benamou–Brenier Approach to Branched Transport
• Self-similar minimizers of a branched transport functional
• On the Complexity of Timetable and Multicommodity Flow Problems
• Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
• 11. On the Lagrangian branched transport model and the equivalence with its Eulerian formulation
• OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
• On the <scp>Well‐Posedness</scp> of Branched Transportation
• Calibrations for minimal networks in a covering space setting
• Approximation of Length Minimization Problems Among Compact Connected Sets
• Flat Chains Over a Finite Coefficient Group

This page was built for publication: A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents