Skip to content

Network Flows: Theory, Algorithms, and Applications.

Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin

Journal of the Operational Research Society · 1994 · 8,132 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994). Network flows: Theory, algorithms, and applications. Journal of the Operational Research Society, 45(11), 1340. https://doi.org/10.2307/2583863

In text: (Smith et al., 1994)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Optimization by Vector Space Methods1970
  2. Theory of Linear and Integer Programming2000
  3. Operations Research -- An Introduction1980

Metadata from OpenAlex (CC0). Citations are generated from the published record.