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

arXiv: https://arxiv.org/abs/1310.2738 · HTML: https://mlsanity.com/paper/1310.2738/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Oct 2013.

## Built on by (most cited first, 1 of 1)

- [Learning Optimal Flows for Non-Equilibrium Importance Sampling](https://mlsanity.com/paper/2206.09908/) (2022)

## Abstract (arXiv)

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.