Network Flows: Theory, Algorithms, and Applications
Editorial Reviews
Book 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.
The publisher, Prentice-Hall Engineering/Science/Mathematics
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.
Network Flows: Theory, Algorithms, and Applications
Network Flows: Theory, Algorithms, and Applications,Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin,Prentice Hall,013617549X,Computer Bks - General Information,Computers - General Information,Decision Making & Problem Solving,General,Mathematical analysis,Mathematical optimization,Network analysis (Planning),Operations Research (Engineering),Optimization (Mathematical Theory),Science/Mathematics,Technology,Telecommunications,Technology / Telecommunications
Hot Books:
Recommended Books