Correa, Jose R.; Schulz, Andreas S.; Stier Moses, Nicolas E. - Sloan School of Management, Massachusetts Institute of … - 2004
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...