A dacorogna-moser approach to flow decomposition and minimal flow problems

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.

Abstract licence: CC BY-NC

29 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.