Abstract
We shall review the four main formalisms proposed for transportation networks in a discrete and continuous framework. Section 2.1 is dedicated to the monge-Kantorovich model. Section 2.2 describes the Gilbert-Steiner discrete irrigation model. Section 2.3 is devoted to the notation of the three continuous mathematical models (transport paths, patterns and traffic plans). Section 2.4.1 lists the mathematical questions and tells where they will be solved in the book. Section 2.5 discusses several extensions and related models in urban optimization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). The Mathematical Models. In: Optimal Transportation Networks. Lecture Notes in Mathematics, vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69315-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-69315-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69314-7
Online ISBN: 978-3-540-69315-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)