The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

The question of how best to transport items across a network–be that traffic over the Internet, or cars over the U.S. highway system–is one that has challenged mathematicians and computer scientists ...

Need to rapidly transport goods across a country or speed the flow of web traffic? Take a souped-up algorithm for a test drive. Finding the optimal route for moving stuff through a network is called ...

The European PRACE organization has published a series of excellent whitepapers on scalable algorithms. Produced as part of the Work Package 8 of the PRACE 1IP Project, the most recent paper is ...

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

This course covers advanced topics in network optimization on continuous and discrete models, including the max-flow problem, the min-cost flow problem, simplex methods for min-cost flow, dual ascent ...

Military Operations Research, Vol. 18, No. 1 (2013), pp. 21-37 (17 pages) ABSTRACTThis paper shows that no simple, common-sense rule of thumb can be used to identify a most-vital arc, even in a simple ...