Network Flows: Theory, Algorithms, and Applications

By Ravindra K. Ahuja

Book 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. 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.

• Format: Hardcover
• Language: English
• ISBN: 013617549X
• ISBN13: 9780136175490
• Release Date: February 1993
• Publisher: Pearson
• Length: 864 Pages
• Weight: 3.10 lbs.
• Dimensions: 1.9" x 7.3" x 9.6"