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

We develop several algorithms for the simple equal flow problem-the network simplex algorithm, the parametric simplex algorithm, the combinatorial parametric algorithm, the binary search algorithm, ...

Researchers have developed a new tool, bimodularity, that adds directionality to community detection in networks.

The objective of the classical minimum cost flow problem is to send units of a good that reside at one or more points in a network (sources or supply nodes) with arc capacities to one or more other ...

Network design problems constitute a critical area in operations research and engineering, where the objective is to construct or upgrade network infrastructures optimally under a range of ...

Eliminating unexplained traffic jams: New algorithm to alleviate traffic flow instabilities Date: October 28, 2013 Source: Massachusetts Institute of Technology Summary: If integrated into ...