Network Flows: Theory, Algorithms, and Applications

Explore this paper's citation graph

Summary

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 are presented.

Type
article
Published
1993-01-01
Cited by
8,379
References
0
Access
Open access

Keywords

Computer science, Algorithm, Project management, Operations research, Management science

References

No references recorded for this paper.

Cited by

Related papers