Network Flows: Theory, Algorithms, and Applications
by Ravindra Ahuja, Thomas Magnanti, James Orlin
Comprehensive coverage of network flow theory, algorithms, and applications with polynomial-time methods, data structures, and over 150 real-world examples across engineering and management.
About This Book
This book presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.
It emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.
The text provides easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.
A special chapter is devoted to conducting empirical testing of algorithms.
The book features over 150 applications of network flows to a variety of engineering, management, and scientific domains and contains extensive reference notes and illustrations.
Reviews
No reviews yet. Be the first to review this book!