maximum flow algorithms Research Articles (Page 2)

Faster Shortest-Path Algorithms for Planar Graphs

We present an algorithm for finding the maximum flow in a 0-1 network. The algorithm is symbolic and does not require explicit enumeration of the nodes and edges of the network. Therefore, it can handle much larger graphs than it was previously possible (more than 10^36 edges). The main idea is to trace (implicitly) sets of edge-disjoint augmenting paths. Disjointness is enforced by solving an edge matching problem for each layer of the network with the help of newly defined priority functions.

A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem

In this paper, we first describe a constraint generation scheme for probabilistic mixed integer programming problems. Next, we present a decomposition approach to the peak capacity expansion planning of interconnected hydrothermal generating systems, with bounds on the transmission capacity between the regions. The objective is to minimize investments in generating units and interconnection links, subject to constraints on supply reliability. The problem is formulated as a stochastic integer program. The constraint generation scheme, which is similar to Benders decomposition, is applied in the solution of the peak capacity expansion problem. The master problem in this decomposition scheme is an integer program, solved by implicit enumeration. The operating subproblem corresponds to a stochastic network flow problem, and is solved by a maximum flow algorithm and Monte Carlo simulation. The approach is illustrated through a case study involving the expansion of the system of the Brazilian Southeastern region.

A fast algorithm for maximum integral two-commodity flow in planar graphs

A new Karzanov-type O( n3) max-flow algorithm

We study the class of preflow push algorithms recently introduced by Goldberg and Tarjan for solving the maximum network flow problem on a weighted digraph G(V,E). We improve Goldberg and Tarjanis O(n3) time bound for the maximum distance preflow push algorithm to O(n2√m) and show that this bound is tight by constructing a parametrized worst case network. We then develop the maximal excess preflow push algorithm and show that it achieves a bound of O(n2√m) pushes. Based on this we develop a maximum network flow algorithm for the synchronous distributed model of computation that uses at most O(n2√m) messages and O(n2) time, thereby improving upon the best previously known algorithms for this model.

Polymatroidal flows with lower bounds

Augmenting path algorithms, first introduced by Ford and Fulkerson (Ford, L. R., D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press, Princeton, N.J.), are widely used in optimization. Examples include Schönsleben's polymatroid intersection algorithm (Schönsleben, P. 1980. Ganzzahlige polymatroid-intersection-algorithmen. Ph.D. thesis, Eidgenössischen Technischen Hochschule, Zürich.), the maximum polymatroidal network flow algorithm of Lawler and Martel (Lawler, E. L., C. U. Martel. 1982. Computing maximal polymatroidal network flows. Math. Oper. Res. 7 334–347.), Frank's algorithm for the Edmonds–Giles polyhedron (Frank, A. 1984. Finding feasible vectors of Edmonds-Giles polyhedra. J. Combin. Theory Ser. B 36 221-239.) and Cunningham's algorithm for testing membership in matroid polyhedra (Cunningham, H. W. 1984. Testing membership in matroid polyhedra. J. Combin. Theory Ser. B 36 161–188.). Here we give an order of magnitude improvement for the above algorithms by using an approach analogous to that of Dinits’ maximum flow algorithm (Dinits, E. A. 1970. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 11 1277–1280.).

An implementation of the algorithm of Karzanov for solving the maximal flow problem is described. After a sketch of Karzanov's idea the Karzanov algorithm is numerically compared with labeling methods. A FORTRAN IV program is listed in the appendix.