Optimal networks for mass transportation problems

DOI10.1051/cocv:2004032zbMath1103.49002OpenAlexW2024004913MaRDI QIDQ3365389

Alessio Brancolini, Giusseppe Buttazzo

Publication date: 23 January 2006

Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=COCV_2005__11_1_88_0

zbMATH Keywords

mass transferoptimal transportationoptimal transportation networksMonge-Kantorovich problem

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Methods involving semicontinuity and convergence; relaxation (49J45) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Related Items

Equivalent formulations for the branched transport and urban planning problems ⋮ Formulation of branched transport as geometry optimization ⋮ General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary ⋮ Path functionals over Wasserstein spaces ⋮ Optimal micropatterns in 2D transport networks and their relation to image inpainting ⋮ Long-term planningversusshort-term planning in the asymptotical location problem ⋮ An optimal irrigation network with infinitely many branching points ⋮ Optimal micropatterns in transport networks ⋮ Duality in branched transport and urban planning

Cites Work

• A model for the quasi-static growth of brittle fractures: Existence and approximation results
• Characterization of optimal shapes and masses through Monge-Kantorovich equation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal networks for mass transportation problems