Duality in branched transport and urban planning
From MaRDI portal
Publication:2084533
DOI10.1007/s00245-022-09927-3zbMath1498.49079arXiv2205.12049OpenAlexW4306252983MaRDI QIDQ2084533
Bernhard Schmitzer, Julius Lohmann, Benedikt Wirth
Publication date: 18 October 2022
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.12049
geometric measure theoryFenchel dualityWasserstein distanceoptimal transportbranched transporturban planningrectifiable networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalent formulations for the branched transport and urban planning problems
- On the Kantorovich-Rubinstein theorem
- Optimal transportation networks. Models and theory
- Optimal urban networks via mass transportation
- Convex analysis and measurable multifunctions
- General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
- Formulation of branched transport as geometry optimization
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal networks for mass transportation problems
- Maß- und Integrationstheorie
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Dynamic models of Wasserstein-1-type unbalanced transport
- Optimal Transport
- Calculus of variations
This page was built for publication: Duality in branched transport and urban planning