We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a...

"November 1990". "This paper is based on materials contained in E.B. Roberts, Entrepreneurs and High-Technology, Lessons from M.I.T. and Beyond (New York: Oxford University Press, forthcoming 1991)."