| Network Flows: Theory, Algorithms, and Applications Contributor(s): Ahuja, Ravindra K. (Author), Magnanti, Thomas L. (Author), Orlin, James B. (Author) |
|
 |
ISBN: 013617549X ISBN-13: 9780136175490 Publisher: Pearson OUR PRICE: $265.99 Product Type: Hardcover - Other Formats Published: February 1993 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Business & Economics | Decision Making & Problem Solving - Technology & Engineering | Telecommunications - History |
| Dewey: 658.403 |
| LCCN: 92-36702 |
| Physical Information: 1.88" H x 7.32" W x 9.59" (3.08 lbs) 864 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. KEY TOPICS: 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. MARKET: For professionals working with network flows, optimization, and network programming. |