Network Flows: Theory, Algorithms, and Applications (Hardcover) (ISBN-13: 9780136175490)

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.

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.

Author: Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
ISBN-10: 013617549X
ISBN-13: 9780136175490
Publisher: Pearson
Language: English
Published: 02/18/1993
Pages: 864
Format: Hardcover
Weight: 3.08lbs
Size: 9.59h x 7.32w x 1.88d