Some Recent Advances in Network Flows
Name
OR-203-89.pdf
Size
4.71 MB
Format
Adobe PDF
Checksum (MD5)
bdea1fc31b914433b9327b74e3c72c5f
Author(s)
Ahuja, Ravindra K., 1956-
Magnanti, Thomas L.
Orlin, James B., 1953-
Date Issued
October 1989
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 203-89
Abstract
The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems. However, the surge of activity on the algorithmic aspects of network flow problems over the past few years has been particularly striking. Several techniques have proven to be very successful in permitting researchers to make these recent contributions: (i) scaling of the problem data; (ii) improved analysis of algorithms, especially amortized average case performance and the use of potential functions; and (iii) enhanced data structures. In this survey, we illustrate some of these techniques and their usefulness in developing faster network flow algorithms. Our discussion focuses on the design of faster algorithms from the worst case perspective and we limit our discussion to the following fundamental problems: the shortest path problem, the maximum flow problem, and the minimum cost flow problem. We consider several representative algorithms from each problem class including the radix heap algorithm for the shortest path problem, preflow push algorithms for the maximum flow problem, and the pseudoflow push algorithms for the minimum cost flow problem.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
