Network Flows: Theory, Algorithms, and Applications

Network Flows: Theory, Algorithms, and Applications

• 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.
• emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.
• provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.
• devotes a special chapter to conducting empirical testing of algorithms.
• features over 150 applications of network flows to a variety of engineering, management, and scientific domains.
• contains extensive reference notes and illustrations.

<P> <B> </B> 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. <B> </B> 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. <B> </B> For professionals working with network flows, optimization, and network programming. </P>