Optimal urban networks via mass transportation

DOI10.1007/978-3-540-85799-0zbMath1190.90003OpenAlexW160928081MaRDI QIDQ947708

Aldo Pratelli, Sergio Solimini, Eugene Stepanov, Giusseppe Buttazzo

Publication date: 6 October 2008

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85799-0

zbMATH Keywords

optimizationgeodesicsrelaxed problemtransportation networksconnected networks

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Geodesics in global differential geometry (53C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Numerical methods of relaxation type (49M20)

Related Items (23)

Optimal covering points and curves ⋮ 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 ⋮ Biological transportation networks: Modeling and simulation ⋮ The Average Distance Problem with Perimeter-to-Area Ratio Penalization ⋮ Optimal Mass Transport on Metric Graphs ⋮ Optimization of urban transport; an alternative to checkerboard towns plans ⋮ The oriented mailing problem and its convex relaxation ⋮ Remarks on the stability of mass minimizing currents in the Monge-Kantorovich problem ⋮ Improved stability of optimal traffic paths ⋮ Optimal micropatterns in 2D transport networks and their relation to image inpainting ⋮ The structure of branched transportation networks ⋮ On the horseshoe conjecture for maximal distance minimizers ⋮ A metric approach to elastic reformations ⋮ Regularity for the Optimal Compliance Problem with Length Penalization ⋮ A presentation of the average distance minimizing problem ⋮ Phase field models for two-dimensional branched transportation problems ⋮ Average-distance problem for parameterized curves ⋮ Optimal micropatterns in transport networks ⋮ Average-distance problem with curvature penalization for data parameterization: regularity of minimizers ⋮ Duality in branched transport and urban planning ⋮ Atomic operators, random dynamical systems and invariant measures

This page was built for publication: Optimal urban networks via mass transportation