Network Flows: Theory, Algorithms, and Applications | 
 enlarge | Authors: Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Publisher: Prentice Hall
Category: Book
List Price: $147.00
Buy New: $89.98
You Save: $57.02 (39%)
New (21) Used (14) from $88.99
Rating:  11 reviews
Sales Rank: 155111
Media: Hardcover
Edition: United States ed
Pages: 864
Number Of Items: 1
Shipping Weight (lbs): 3.7
Dimensions (in): 9.4 x 7.2 x 2.1
ISBN: 013617549X
Dewey Decimal Number: 658.4032
EAN: 9780136175490
Publication Date: February 28, 1993
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Condition: Brand New Book. Same or Next Day Shipping! Free tracking # upon request !
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
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.
|
| Customer Reviews: Read 6 more reviews...
 the best network flow book for computer scientists December 17, 2004
David W. Straight (knoxville, tennessee United States)
9 out of 9 found this review helpful
I've been using this book as the primary text for my class in
"Network Flow Programming" (senior & graduate level) at the
University of Tennessee for about 10 years. Prior to that time
I had used Jensen & Barnes' Network Flow Programming (now long out
of print). The code in Jensen & Barnes is in FORTRAN (not so fun
or useful for CS majors) and the intended audience seemed to be OR.
Ahuja's code is pascal pseudo-code for the most part, which usually
translates easily into the C language that most of our students
use.
For CS students, there is excellent use of algorithm analysis
(big-O) throughout the book, and there are long discussions
about different approaches and algorithms and the complexity of
each. There is a lot of mathematical notation, but my students
have never had to worry about PDEs and the like here. Any good
advanced CS student (graduate or undergraduate) will find the
book very worthwhile. In my course the students must implement
min-cost spanning trees, shortest paths, critical path/PERT
networks (not in Ahuja), max flow, and min-cost flow. I would
also recommend (for CS majors) Tarjan's excellent (and
succinct) Data Structures and Network Algorithms.
Great book for Network Theory and Application August 1, 2002
Tiravat Assavapokee (Georgia Tech, Atlanta, GA United States)
1 out of 1 found this review helpful
This book contains a lot of great algorithms for network flow theory and it also contains many of the great applications, which are very useful in practice. This book is very completed. Personally, I learn a lot of new things about Multi commodity Flow, which are the use of Lagrangian Relaxation, Column generation, Resource allocation techniques for solving multi commodity flow. There are also the good chapters in Convex cost flow and Generalized Flow and good appendix in complexity. Beside this book is very easy to read and understand. It is a great idea to have if you are in OR or IE major. :)
Great book for Network Theory and Application September 25, 2003
Tiravat Assavapokee (Georgia Tech, Atlanta, GA United States)
1 out of 1 found this review helpful
This book contains a lot of great algorithms for network flow theory and it also contains many of the great applications, which are very useful in practice. This book is very completed. Personally, I learn a lot of new things about Multi commodity Flow, which are the use of Lagrangian Relaxation, Column generation, Resource allocation techniques for solving multi commodity flow. There are also the good chapters in Convex cost flow and Generalized Flow and good appendix in complexity. Beside this book is very easy to read and understand. It is a great idea to have if you are in OR or IE major. :)
Bible for Network flows December 28, 2001
4 out of 6 found this review helpful
Go for it! Other books do give algorithms but some of them have sloopy versions of the algorithms. This book not only gives the efficient versions of algorithms but also gives pseudo code for all of them. And the treatment of the subject itself is flawless. The theory leading to algorithms is very important to understand the algorithms and the authors do an excellent job. The way the book is organised the pictures and examples - everything is perfect. The exercises are not just number crunching problems but real good problems which require lot of thinking.
First and only book for network modeling/programming April 20, 1999
Sarawoot Chittratanawat (Bangkok, THAILAND)
4 out of 11 found this review helpful
Ahuja creates one of the best operations research book on the planet. I'm afraid no one can conduct network modeling without take a look at this book though. Go for it!
|
|
|
