Network flows: theory, algorithms, and applications

Front Cover
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.

From inside the book

What people are saying - Write a review

User Review - Flag as inappropriate

Approachable, powerful text.

Contents

INTRODUCTION
1
PATHS TREES AND CYCLES
23
ALGORITHM DESIGN AND ANALYSIS
53
Copyright

25 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information