Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Network Flows: Theory, Algorithms, and Applications

Network Flows: Theory, Algorithms, and Applications

Ahuja, Ravindra
Magnanti, Thomas
Orlin, James

Hardcover

Business GeneralTechnology & EngineeringGeneral World History

ISBN10: 013617549X
ISBN13: 9780136175490
Publisher: Pearson
Published: Feb 18 1993
Pages: 864
Weight: 3.08
Height: 1.88 Width: 7.32 Depth: 9.59
Language: English
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.

    2 different editions

    Also available

    Also in

    Business General

    View All