Optimal transportation networks : models and theory
Author(s)
Bibliographic Information
Optimal transportation networks : models and theory
(Lecture notes in mathematics, 1955)
Springer, c2009
Available at 59 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. 193-197) and index
Description and Table of Contents
Description
The transportation problem can be formalized as the problem of ?nding + ? the optimal paths to transport a measure ? onto a measure ? with the same mass. In contrast with the Monge-Kantorovich formalization, recent approaches model the branched structure of such supply networks by an energy functional whose essential feature is to favor wide roads. Given a ?ow ? in a tube or a road or a wire, the transportation cost per unit length ? is supposed to be proportional to ? with 0
Table of Contents
Introduction: The Models.- The Mathematical Models.- Traffic Plans.- The Structure of Optimal Traffic Plans.- Operations on Traffic Plans.- Traffic Plans and Distances between Measures.- The Tree Structure of Optimal Traffic Plans and their Approximation.- Interior and Boundary Regularity.- The Equivalence of Various Models.- Irrigability and Dimension.- The Landscape of an Optimal Pattern.- The Gilbert-Steiner Problem.- Dirac to Lebesgue Segment: A Case Study.- Application: Embedded Irrigation Networks.- Open Problems.
by "Nielsen BookData"