Coupon
Network Flows : Theory, Algorithms, and Applications
by Ravindra K. Ahuja and Thomas L. Magnanti and James B. Orlin


Overview - 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.  Read more...

 
Hardcover
  • $240.40
Sorry: This item is not currently available.

This item is Non-Returnable.
FREE Shipping for Club Members
 
> Check In-Store Availability

In-Store pricing may vary

 
 
New & Used Marketplace 18 copies from $30.97
 
 
 
 

More About Network Flows by Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin
 
 
 
Overview
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.


This item is Non-Returnable.

 
Details
  • ISBN-13: 9780136175490
  • ISBN-10: 013617549X
  • Publisher: Pearson
  • Publish Date: January 1993
  • Page Count: 864
  • Dimensions: 9.59 x 7.32 x 1.88 inches
  • Shipping Weight: 3.08 pounds


Related Categories

Books > Business & Economics > Decision Making & Problem Solving
Books > Technology & Engineering > Telecommunications
Books > History > General

 
BAM Customer Reviews