Network Flows Bibliography (10/28/2001)

Prepared by:

Joseph Malkevitch
Mathematics and Computing Department
York College (CUNY)
Jamaica, New York 11451-0001

Email: (for additions, suggestions, and corrections)

Ahuja, R. and T. Magnati, J. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, 1993.

Battersby, A., Network Anaysis for Planning and Scheduling, (3rd. ed.), Macmillan, London, 1970.

Bazaraa, M. and J. Jarvis, Linear Programming and Newtwork Flows, Wiley, New York, 1977.

Burr, S. (ed.), The Mathematics of Networks, Volume 26, Proceedings of Symposia in Applied Mathematics, American Mathematical Society, Providence, 1982.

Dolan, A. and J. Aldous, Networks and Algorithms, Wiley, New York, 1993.

Even, S., Graph Algorithms, Computer Science Press, Rockville, 1979.

Ford L. and D. Fulkerson, Flows in Networks, Princeton U. Press, Princeton, 1957.

Goldberg, A., Efficient graph algorithms for sequential and parallel computers, Ph.D. thesis, MIT, Cambridge, 1987.

Goldberg, A., and R. Tarjan, A new approach to the maximum-flow problem, J. Assoc. Comput. Mach. 35 (1988) 921-940.

Hardwick, I., Decision and Discrete Mathematics, Albion Publishing, Chichester, 1996.

Hoare, H., Project Management using Network Analysis, McGraw Hill, London, 1973.

Hu, T., Integer Programming and Network Flows, Addison-Wesley, Reading 1969.

Iri, M., Network Flow, Transportation and Scheduling, Academic Press, New York, 1969.

Johnson, D. and C. McGeoch, (eds.), Network Flows and Matchings, American Mathematical Society, 1993.

Larson, R. and A. Odoni, Urban Operations Research, Prentice-Hall, Englewood Cliffs, 1981.

Lawler, E., Combinatorial Optimization: Networks and Matroids, Holt, Rhinehart and Winston, New York, l976.

Lockyer, K., An Introduction to Critical Path Analysis, Pitman, London, 1977.

Tarjan, R., Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1983.

Back to list of bibliographies