Network Flow, Transportation and Scheduling: Theory and Algorithms
โ Scribed by Masao Iri (Eds.)
- Publisher
- Academic Press
- Year
- 1969
- Tongue
- English
- Leaves
- 327
- Series
- Mathematics in Science and Engineering 57
- Edition
- 1st Ed
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum
Prentice Hall, 1993. โ 863 p.<div class="bb-sep"></div>Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability
Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow probl
<p><P><STRONG>Schedule-Based Modeling of Transportation Networks: Theory and Applications</STRONG> follows the book <EM>Schedule-Based Dynamic Transit Modeling</EM>, published in this series in 2004, recognizing the critical role that schedules play in transportation systems.</P><P></P><P>Conceived