Network Flows: Theory, Algorithms, and Applications

ISBN-13: 9780136175490
ISBN-10: 013617549X
Edition: 1
Author: Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Publication date: 1993
Publisher: Pearson
Format: Hardcover 864 pages
Category: Computers
FREE shipping on ALL orders

Book details

ISBN-13: 9780136175490
ISBN-10: 013617549X
Edition: 1
Author: Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Publication date: 1993
Publisher: Pearson
Format: Hardcover 864 pages
Category: Computers

Summary

Acknowledged authors Ravindra K. Ahuja , Thomas L. Magnanti , James B. Orlin wrote Network Flows: Theory, Algorithms, and Applications comprising 864 pages back in 1993. Textbook and eTextbook are published under ISBN 013617549X and 9780136175490. Since then Network Flows: Theory, Algorithms, and Applications textbook was available to sell back to BooksRun online for the top buyback price of $ 24.78 or rent at the marketplace.

Description

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.
    Rate this book Rate this book

    We would LOVE it if you could help us and other readers by reviewing the book