Abstract
Problem 15.1. Let \( \chi _n \in TP\left( {\mu _n^ + ,\mu _n^ - } \right) \) be a sequence of optimal traffic plans such that \( E^\alpha \left( {\chi _n } \right) \) is uniformly bounded and \( \chi _n \) converges to χ. Is χ optimal?
Keywords
- Lebesgue Measure
- Graph Structure
- Tangent Cone
- Construction Algorithm
- Steiner Point
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Open Problems. In: Optimal Transportation Networks. Lecture Notes in Mathematics, vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69315-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-69315-4_15
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)
