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

In the "classical" network flow model, flows are constrained by the capacities of individual arcs. In the "polymatroidal" network flow model introduced in this paper, flows are constrained by the ...

In many actual network flow situations, nodes as well as arcs have limited capacities. This paper presents, for such a network, an algorithm for maximizing flow from a source node to a sink node. The ...