Abstract

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.

Keywords

Computer scienceAlgorithmProject managementOperations researchManagement scienceSystems engineeringMathematicsEconomicsEngineering

Affiliated Institutions

Related Publications

An overview of statistical learning theory

Vladimir Vapnik

Statistical learning theory was introduced in the late 1960's. Until the 1990's it was a purely theoretical analysis of the problem of function estimation from a given collectio...

1999 IEEE Transactions on Neural Networks 6095 citations

Publication Info

Year
1994
Type
article
Volume
45
Issue
11
Pages
1340-1340
Citations
8135
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

8135
OpenAlex

Cite This

David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. (1994). Network Flows: Theory, Algorithms, and Applications.. Journal of the Operational Research Society , 45 (11) , 1340-1340. https://doi.org/10.2307/2583863

Identifiers

DOI
10.2307/2583863