A Dacorogna-Moser approach to flow decomposition and minimal flow problems
From MaRDI portal
(Redirected from Publication:3465863)
Abstract: The papers describes an easy approach, based on a classical construction by Dacorogna and Moser, to prove that optimal vector fields in some minimal flow problem linked to optimal transport models (congested traffic, branched transport, Beckmann's problem...) are induced by a probability measure on the space of paths. This gives a new, easier, proof of a classical result by Smirnov, and allows handling optimal flows without taking care of the presence of cycles.
Recommendations
Cited in
(8)- Stability of optimal traffic plans in the irrigation problem
- The Monge problem with vanishing gradient penalization: vortices and asymptotic profile
- Integral flow decomposition with minimum longest path length
- Three superposition principles: currents, continuity equations and curves of measures
- Approximation of length minimization problems among compact connected sets
- Monge and feasibility sequences in general flow problems
- A continuous model of transportation in the Heisenberg group
- An icer approach to the theory of minimal flows
This page was built for publication: A Dacorogna-Moser approach to flow decomposition and minimal flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465863)
