Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the well-posedness of branched transportation

Published 7 Apr 2019 in math.AP | (1904.03683v1)

Abstract: We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book Optimal transportation networks, by Bernot, Caselles and Morel), which has been addressed up to now only under restrictive assumptions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.