Network Flows: Theory, Algorithms, and Applications

  1. Main >
Detail Image
click to view more

Network Flows: Theory, Algorithms, and Applications

by Ahuja, Ravindra

$308.29

add to favourite
  • In Stock - Ship in 24 hours with Free Online tracking.
  • FREE DELIVERY by Tuesday, July 22, 2025
  • 24/24 Online
  • Yes High Speed
  • Yes Protection

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.

    Last updated on

    Product Details

    • Feb 18, 1993 Pub Date:
    • 013617549X ISBN-10:
    • 9780136175490 ISBN-13:
    • English Language