Formulation of branched transport as geometry optimization
From MaRDI portal
Publication:2145851
Abstract: The branched transport problem, a popular recent variant of optimal transport, is a non-convex and non-smooth variational problem on Radon measures. The so-called urban planning problem, on the contrary, is a shape optimization problem that seeks the optimal geometry of a street or pipe network. We show that the branched transport problem with concave cost function is equivalent to a generalized version of the urban planning problem. Apart from unifying these two different models used in the literature, another advantage of the urban planning formulation for branched transport is that it provides a more transparent interpretation of the overall cost by separation into a transport (Wasserstein-1-distance) and a network maintenance term, and it splits the problem into the actual transportation task and a geometry optimization.
Recommendations
- Equivalent formulations for the branched transport and urban planning problems
- Duality in branched transport and urban planning
- General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
- A Benamou–Brenier Approach to Branched Transport
- An equivalent path functional formulation of branched transportation problems
Cites work
- A phase-field approximation of the Steiner problem in dimension two
- A Proof of Lusin's Theorem
- A variational model of irrigation patterns
- Calculus of variations
- Equivalent formulations for the branched transport and urban planning problems
- Existence and regularity results for the Steiner problem
- Fine variation and fractal measures
- General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
- Gradient flows in metric spaces and in the space of probability measures
- scientific article; zbMATH DE number 46153 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 558357 (Why is no real title available?)
- scientific article; zbMATH DE number 739280 (Why is no real title available?)
- scientific article; zbMATH DE number 2024202 (Why is no real title available?)
- scientific article; zbMATH DE number 3280853 (Why is no real title available?)
- scientific article; zbMATH DE number 3280855 (Why is no real title available?)
- Interior regularity of optimal transport paths
- Maß- und Integrationstheorie
- Measurable selections of extrema
- Optimal networks for mass transportation problems
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal transportation networks. Models and theory
- Optimal urban networks via mass transportation
- Path functionals over Wasserstein spaces
- Phase field approximations of branched transportation problems
- Phase field models for two-dimensional branched transportation problems
- Rectifiability of flat chains
- Rectifiable Metric Spaces: Local Structure and Regularity of the Hausdorff Measure
- Synchronic and asynchronic descriptions of irrigation problems
- Traffic plans
- Transformations by functions in Sobolev spaces and lower semicontinuity for parametric variational problems
Cited in
(12)- General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
- Optimal micropatterns in 2D transport networks and their relation to image inpainting
- A fractal shape optimization problem in branched transport
- Duality in branched transport and urban planning
- Branching structures emerging from a continuous optimal transport model
- Variational problems for tree roots and branches
- A Benamou–Brenier Approach to Branched Transport
- An adaptive finite element approach for lifted branched transport problems
- A multimaterial transport problem and its convex relaxation via rectifiable G-currents
- Sparsity for dynamic inverse problems on Wasserstein curves with bounded variation
- A variational method for curve extraction
- Optimal quantization with branched optimal transport distances
This page was built for publication: Formulation of branched transport as geometry optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145851)
