Ravindra K. Ahuja

Thomas L. Magnanti

James B. Orlin

An introduction to network flows discusses paths, algorithms, shortest paths, maximum flows, minimum cost flows, convex cost flows, generalized flows, and other topics

Theory, Algorithms, and Applications

Network Flows

Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.

Thomas L. Magnanti

About

Books

Join the club