The pseudoflow algorithm: A new algorithm for the maximum-flow problem

Operations Research

Volumn 56, Issue 4, 2008, Pages 992-1009

  Hochbaum, Dorit S ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BREAK-POINTS; FLOW PROBLEMS; LINEAR TIME; MAXIMUM-FLOW ALGORITHMS; OPTIMAL SOLUTIONS; SIMPLEX ALGORITHMS; TREE NETWORKS;

MANGANESE COMPOUNDS; OPTIMAL SYSTEMS;

ALGORITHMS;

EID: 53149130323     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0524     Document Type: Article

References (27)

1. Anderson, C., D. S. Hochbaum. 2002. The performance of the pseudoflow algorithm, for the maximum flow and minimum cut problems. Manuscript, University of California, Berkeley.
2. Boldyreff, A. W. 1955. Determination of the maximal steady state flow of traffic through a railroad network. J. Oper. Res. Soc. Amer. 3(4) 443-465.
3. Chandran, B., D. S. Hochbaum. 2003. Experimental study of the pseudoflow push-relabel algorithm. Manuscript, University of California, Berkeley.
4. Cunningham, W. H. 1976. A network simplex method. Math. Programming 1(1) 105-116.
5. Dinic, E. A. 1970. Algorithm for solution of a problem of maximal flow in a network, with power estimation. Soviet Math. Dokl. 11 1277-1280.
6. Ford, L. R., Jr., D. R. Fulkerson. 1957. A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canad. J. Math. 9 210-218.
7. Gale, D. 1957. A theorem of flows in networks. Pacific J. Math. 7(1057) 1073-1082.
8. Gallo, G., M. D. Grigoriadis, R. E. Tarjan. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1) 30-55.
9. Goldberg, A. V., S. Rao. 1998. Beyond the flow decomposition barrier. J. ACM 45 783-797.
10. Goldberg, A. V., R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. ACM 35 921-940.
11. Goldberg, A. V., M. D. Grigoriadis, R. E. Tarjan. 1991. The use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Programming 50 277-290.
12. Goldfarb, D., W. Chen. 1997. On strongly polynomial dual algorithms for the maximum flow problem. Special issue of Math. Programming, Ser. B 78(2) 159-168.
13. Gusfield, D., E. Tardos. 1994. A faster parametric minimum-cut algorithm. Algorithmica 11(3) 278-290.
14. Hochbaum, D. S. 2001. A new-old algorithm for minimum-cut and maximum-flow in closure graphs. Networks 37(4) 171-193.
15. Hochbaum, D. S. 2003. Efficient algorithms for the inverse spanning tree problem. Oper. Res. 51(5) 785-797.
16. Hochbaum, D. S., B. G. Chandran. 2004. Further below the flow decomposition barrier of maximum flow for bipartite matching and maximum closure. Submitted.
17. Hoffman, A. J. 1960. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. R. Bellman, M. Hall Jr., eds. Proc. Sympos. Appl. Math., Vol. 10. Combinatorial Analysis. American Mathematical Society, Providence, 113-127.
18. Karzanov, A. V. 1974. Determining the maximal flow in a network with a method of preflows. Soviet Math. Dokl. 15 434-437.
19. King, V., S. Rao, R. Tarjan. 1994. A faster deterministic maximum flow algorithm. J. Algorithms 17(3) 447-474.
20. Lerchs, H., I. F. Grossmann. 1965. Optimum design of open-pit mines. Trans. Canad. Inst. Mining, Metallurgy, Petroleum 68 17-24.
21. 3) algorithm for finding maximum flows in networks. Inform. Proc. Lett. 7(6) 277-278.
22. Martel, C. 1989. A comparison of phase and nonphase network, flow algorithms. Networks 19(6) 691-705.
23. Picard, J.-C. 1976. Maximal closure of a graph and applications to combinatorial problems. Management Sci. 22(11) 1268-1272.
24. Radzik, T. 1993. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. P. M. Pardalos, ed. Complexity in Numerical Optimization. World Scientific, Hackensack, NJ, 351-386.
25. Sleator, D. D., R. E. Tarjan. 1983. A data structure for dynamic trees. J. Comput. System Sci. 24 362-391.
26. Sleator, D. D., R. E. Tarjan. 1985. Self-adjusting binary search trees. J. ACM 32 652-686.
27. Vygen, J. 2002. On dual minimum cost flow algorithms. Math. Methods Oper. Res. 56 101-126.