Network flows: theory, algorithms, and applications

Front Cover
Prentice Hall, 1993 - Business & Economics - 846 pages
5 Reviews
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 problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.

From inside the book

What people are saying - Write a review

User ratings

5 stars
5
4 stars
0
3 stars
0
2 stars
0
1 star
0

User Review - Flag as inappropriate

Approachable, powerful text.

Review: Network Flows: Theory, Algorithms, and Applications

User Review  - Joecolelife - Goodreads

Dr.Tom and other authors have done a great job in writing this book. The book covers a lot of topics in Network Programming and a variety of algorithms are cited. A must buy for any serious student taking a course in Network Programming. Read full review

Contents

INTRODUCTION
1
PATHS TREES AND CYCLES
23
ALGORITHM DESIGN AND ANALYSIS
53
Copyright

25 other sections not shown

Common terms and phrases

Bibliographic information