We prove that optimal traffic plans for the mailing problem in Rd are stable with respect to variations of the given coupling, above the critical exponent α=1−1/d, thus solving an open problem stated in the book Optimal transportation networks, by Bernot, Caselles and Morel. We apply our novel result to study some regularity properties of the minimizers of the mailing problem, showing that only finitely many connected components of an optimal traffic plan meet together at any branching point. ©2019 Elsevier Masson SAS. All rights reserved
Stability for the mailing problem / Colombo, M.; De Rosa, A.; Marchese, A.. - In: JOURNAL DE MATHÉMATIQUES PURES ET APPLIQUÉES. - ISSN 0021-7824. - 128:(2019), pp. 152-182. [10.1016/j.matpur.2019.01.020]
Stability for the mailing problem
Marchese A.
2019-01-01
Abstract
We prove that optimal traffic plans for the mailing problem in Rd are stable with respect to variations of the given coupling, above the critical exponent α=1−1/d, thus solving an open problem stated in the book Optimal transportation networks, by Bernot, Caselles and Morel. We apply our novel result to study some regularity properties of the minimizers of the mailing problem, showing that only finitely many connected components of an optimal traffic plan meet together at any branching point. ©2019 Elsevier Masson SAS. All rights reserved| File | Dimensione | Formato | |
|---|---|---|---|
|
jmpa.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
606.3 kB
Formato
Adobe PDF
|
606.3 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
