Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

  title={Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems},
  author={Jack Edmonds and Richard M. Karp},
  journal={Journal of the ACM (JACM)},
  pages={248 - 264}
  • J. Edmonds, R. Karp
  • Published 1 April 1972
  • Mathematics, Computer Science
  • Journal of the ACM (JACM)
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps required by earlier algorithms. First, the paper states the maximum flow problem, gives the Ford-Fulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths… 
The Minimum Cost Flow Problem and The Network Simplex Solution Method
The Minimum Cost Flow (MCF) Problem is to send flow from a set of supply nodes, through the arcs of a network, to a set of demand nodes, at minimum total cost, and without violating the lower and
Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow Problem
  • M. Queyranne
  • Mathematics, Computer Science
    Math. Oper. Res.
  • 1980
It is shown that the sequence of flows constructed by Capacity converges toward a maximum flow, which contrasts with the existence of other less “greedy” augmenting path algorithms which are always finite.
A capacity scaling algorithm for the constrained maximum flow problem
This paper suggests capacity scaling algorithms that solve both versions of the constrained maximum flow problem in o((m log M) s(n, m)) time, where n is the number of nodes in the network, m is theNumber of arcs, M is an upper bound on the largest element in the data, and s( n, m) is the time required to solve a shoflest path problem with nonnegative arc lengths.
Quick Max-flow Algorithm
A parameterized and easy to implement family of algorithms of finding a saturating flow in a layered network and there is a particularly interesting “balanced” member of the family for which a calculated upper bound on complexity is still O(V2L) but there is known no example of a layer that needs more than O(E + V(3/2) time to resolve.
A new approach to the maximum flow problem
By incorporating the dynamic tree data structure of Sleator and Tarjan, a version of the algorithm running in O(nm log(n'/m)) time on an n-vertex, m-edge graph is obtained, as fast as any known method for any graph density and faster on graphs of moderate density.
Faster Scaling Algorithms for Network Problems
This paper presents algorithms for the assignment problem, the transportation problem, and the minimum-cost flow problem of operations research. The algorithms find a minimum-cost solution, yet run
A new approach to the maximum-flow problem
An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.
Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new
A new scaling algorithm for the minimum cost network flow problem
A new polynomial time algorithm for solving the minimum cost network flow problem, based on Edmonds-Karp's capacity scaling and Orlin's excess scaling algorithms, which works directly with the given data and original network, and dynamically adjusts the scaling factor between scaling phases.
Minimal-cost network flow problems with variable lower bounds on arc flows
This paper formulates the new model, referred to as MCNF-VLB, as a mixed integer linear programming, and shows its NP-hard complexity, and a comprehensive computational testing on using CPLEX to solve the MCNF's instances of up to medium-to-large size.


On a Class of Capacitated Transportation Problems
Transportation models ordinary and transhipment having certain types of capacity constraints on the flows between origins and destinations are studied from the point of view of transforming them into
Paths, Trees, and Flowers
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An
  • 1970
Bottleneck extrema
  • 1968
On the equivalence of the capacity-constrained transshipment problem and the Hitchcock problems
  • RAND Corp. Memorandum RM
  • 1960
Apply Algorithm C repeatedly, starting with the pair (f, ~r), until a compatible pair (g, 8) is obtained. Set f = g and ~-= 0
By iteration of Algorithm C, the pair (2f
Note. References [1, 3, 6, 7] are not cited in the text
  • Note. References [1, 3, 6, 7] are not cited in the text