DOIAbstract
The problem of branched transportation aims to describe the movement of masses when, due to concavity effects, they have the interest to travel together as much as possible, because the cost for a path of length $\ell$ covered by a mass $m$ is proportional to $m^\alpha\ell$ with $0<\alpha<1$. The optimization of this criterion let branched structures appear and is suitable to applications like road systems, blood vessels, river networks\dots Several models have been employed in the literature to present this transport problem, and the present paper looks at a dynamical one, similar to the celebrated Benamou-Brenier formulation of Kantorovitch optimal transport. The movement is represented by a path $\rho_t$ of probabilities, connecting an i...
Add to ORKG