Programming Books C Java PHP Python Learn more Browse Programming Books
  • List Price: $217.60
  • Save: $162.71 (75%)
Rented from Amazon Warehouse Deals
To Rent, select Shipping State from options above
Due Date: Dec 21, 2014
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Qty:1
  • List Price: $217.60
  • Save: $44.07 (20%)
Usually ships within 3 to 4 weeks.
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Trade in your item
Get a $38.58
Gift Card.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Network Flows: Theory, Algorithms, and Applications Hardcover – February 28, 1993

ISBN-13: 978-0136175490 ISBN-10: 013617549X Edition: 1st

Buy New
Price: $173.53
Rent
Price: $54.89
27 New from $144.99 29 Used from $83.28
Rent from Amazon Price New from Used from
Hardcover
"Please retry"
$54.89
$173.53
$144.99 $83.28
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

Network Flows: Theory, Algorithms, and Applications + Introduction to Algorithms, 3rd Edition
Price for both: $257.85

One of these items ships sooner than the other.

Buy the selected items together

Customers Who Bought This Item Also Bought

NO_CONTENT_IN_FEATURE

Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Hardcover: 864 pages
  • Publisher: Prentice Hall; 1 edition (February 28, 1993)
  • Language: English
  • ISBN-10: 013617549X
  • ISBN-13: 978-0136175490
  • Product Dimensions: 9.6 x 7.3 x 1.9 inches
  • Shipping Weight: 4.4 pounds (View shipping rates and policies)
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (13 customer reviews)
  • Amazon Best Sellers Rank: #137,228 in Books (See Top 100 in Books)

Editorial Reviews

From the Publisher

A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.

From the Back Cover

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.


More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

4.5 out of 5 stars
Share your thoughts with other customers

Most Helpful Customer Reviews

104 of 107 people found the following review helpful By A Customer on February 27, 2002
Format: Hardcover
First of all, I am not surprised that the book
got so many good reviews: at first look, it is truly
impressive, and it is clearly a work of love. I was
looking forward to teaching from it.
It is quite clear from the reviews though, that the
reviewers have not **used** it for teaching; they may
have browsed it at most.
The first disappointments came very soon in the course I
taught. The biggest flaw of the book is the really bad style
in which the proofs are written. They manage to be seemingly
overflowing with explanation, and at the same time difficult
to understand. They gloss over many details: if the teacher
tries to skip these, an alert student could easily make
him/her look pretty silly.
One case in point is the proof of the label correcting
algorithm's correctness starting on page 136. I knew this
material from before, so I thought preparing class from
here would be a breeze. I was wrong: after going back to
my notes, and breaking up the mess into several simple
claims did I manage to make notes from which I could teach.
Whoever missed the class was helpless, when they looked
for explanation in the book.
I only remark, that all classes that I taught from this book
were at some of the top 10 OR depts at the US... so this is
hardly the students' fault.
Many exercises are wrong as well, and although the authors
claim that they will try to fix the mistakes, they hardly ever
reply to reader's comments, as some of my fellow professors
told me.
I can only compare the style of the exposition to the
later written Combinatorial Optimization book by
Cunningham et. al. There is a WORLD of difference.
Read more ›
2 Comments Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
16 of 16 people found the following review helpful By David W. Straight on December 17, 2004
Format: Hardcover
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
24 of 28 people found the following review helpful By Dr. Lee D. Carlson HALL OF FAMEVINE VOICE on June 4, 2001
Format: Hardcover
This book is a comprehensive overview of network flow algorithms with emphasis on cost constraint algorithms. In chapter 1 the authors introduce the network flow problems that will be studied in the book along with a discussion of the applications of these problems.
The terminology needed for network flow problems is introduced in Chapter 2, with rigorous definitions given for graphs, trees, and network representations. Most interesting is the discussion on network transformations, for here the authors discuss how to simplify networks to make their study more tractable.
An overview of complexity concepts in algorithms is given in the next chapter. A good discussion is given on parameter balancing. Pseudocode is given at various places to illustrate the algorithms.
Chapter 4 discusses shortest-path algorithms, with emphasis on label-setting algorithms. For network modelers and designers involved in routing algorithms, there is a nice discussion of Dijkstra's algorithm in this chapter, along with a treatment of how to improve on that algorithm by using Dial's, heap, and radix heap implementations.
A more general discussion of shortest path algorithms follows in Chapter 5, with details on label-correcting algorithms. The reader is asked to investigate the Bellman's equations in the exercises.
The maximum flow algorithm is treated in Chapter 6, and the reader with a background in linear programming will see ideas from that area applied nicely here. An application to parallel programming is given also. The maximum flow problem is treated using algorithms that improve worst-case complexity in Chapter 7, by employing the preflow-push algorithms.
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Tiravat Assavapokee on July 31, 2002
Format: Hardcover
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. :)
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images

Most Recent Customer Reviews


What Other Items Do Customers Buy After Viewing This Item?