We are concerned with the minimal cost flow problem in infinite networks. The generalisation to infinite networks is made in order to provide tools for the study of the dynamics of such networks. By disintegration methods, we obtain that the minimal transportation costs are the supremum of the diffe
โฆ LIBER โฆ
Semigroups for flows in infinite networks
โ Scribed by Britta Dorn
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 395 KB
- Volume
- 76
- Category
- Article
- ISSN
- 0037-1912
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Infinite networks: Minimal cost flows
โ
B. Fuchssteiner; K. Morisse
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 323 KB
Flows in infinite networks represented b
โ
B. Fuchssteiner; K. Morisse
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 294 KB
We are concerned with minimal cost flows in infinite networks. As an application of a Hahn-Banach type monotone extension theorem for convex cones, an abstract theorem characterizing minimal cost flows by local price systems is obtained for a general vector lattice situation. This result extends the
Asymptotic periodicity of recurrent flow
โ
Britta Dorn; Vera Keicher; Eszter Sikolya
๐
Article
๐
2008
๐
Springer-Verlag
๐
French
โ 461 KB
A simplex algorithm for minimum-cost net
โ
Thomas C. Sharkey; H.Edwin Romeijn
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 217 KB
Factorizations of infinite sequences in
โ
J. Justin; A. V. Kelarev
๐
Article
๐
1998
๐
Springer
๐
English
โ 643 KB
Perturbations of finite networks and asy
โ
Dรกvid Kunszenti-Kovรกcs
๐
Article
๐
2008
๐
Springer
๐
English
โ 433 KB