A Dacorogna-Moser approach to flow decomposition and minimal flow problems

DOI10.1051/PROC/201445027MaRDI QIDQ3465863zbMATH OpenOpenAlexFDO

Authors Filippo Santambrogio

Publication date 29 January 2016

Published in ESAIM: Proceedings and Surveys (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20)

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

• Optimal transportation flows
• Minimizing Flows for the Monge--Kantorovich Problem
• Minimal measures, one-dimensional currents and the Monge-Kantorovich problem
• A continuous model of transportation revisited
• Optimal Multiphase Transportation with prescribed momentum

Cited in

(7)

• Monge and feasibility sequences in general flow problems
• The Monge problem with vanishing gradient penalization: vortices and asymptotic profile
• Approximation of length minimization problems among compact connected sets
• Integral flow decomposition with minimum longest path length
• Three superposition principles: currents, continuity equations and curves of measures
• Stability of optimal traffic plans in the irrigation problem
• 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)