General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
From MaRDI portal
Publication:1650891
DOI10.1007/s00526-018-1364-4zbMath1394.49045arXiv1705.00162OpenAlexW2964085906MaRDI QIDQ1650891
Alessio Brancolini, Benedikt Wirth
Publication date: 16 July 2018
Published in: Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.00162
Deterministic network models in operations research (90B10) Variational problems in a geometric measure-theoretic setting (49Q20) Optimization of shapes other than minimal surfaces (49Q10)
Related Items
Ramified Optimal Transportation with Payoff on the Boundary ⋮ A multi-material transport problem with arbitrary marginals ⋮ Formulation of branched transport as geometry optimization ⋮ On the lower semicontinuous envelope of functionals defined on polyhedral chains ⋮ Generic uniqueness of optimal transportation networks ⋮ The oriented mailing problem and its convex relaxation ⋮ Phase field models for two-dimensional branched transportation problems ⋮ Phase field approximations of branched transportation problems ⋮ Stability for the mailing problem ⋮ A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents ⋮ Approximation of rectifiable 1-currents and weak-\(\ast\) relaxation of the \(h\)-mass ⋮ Duality in branched transport and urban planning
Cites Work
- Equivalent formulations for the branched transport and urban planning problems
- On landscape functions associated with transport paths
- Fractal regularity results on optimal irrigation patterns
- On the Hölder regularity of the landscape function
- The structure of branched transportation networks
- Optimal transportation networks. Models and theory
- Optimal urban networks via mass transportation
- A new class of transport distances between measures
- Normal currents: structure, duality pairings and div-curl lemmas
- A variational model of irrigation patterns
- The deformation theorem for flat chains
- Optimal micropatterns in 2D transport networks and their relation to image inpainting
- Rectifiability of flat chains
- Interior regularity of optimal transport paths
- Convex relaxation of a class of vertex penalizing functionals
- Optimal channel networks, landscape function and branched transport
- On the lower semicontinuous envelope of functionals defined on polyhedral chains
- Traffic plans
- Synchronic and Asynchronic Descriptions of Irrigation Problems
- Optimal micropatterns in transport networks
- Optimal networks for mass transportation problems
- Compactness theorems for differential forms
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Flat Chains Over a Finite Coefficient Group
- Optimal Transport
- Scaling, optimality, and landscape evolution.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
