Computational investigations of maximum flow algorithms

European Journal of Operational Research

Volumn 97, Issue 3, 1997, Pages 509-542

  Ahuja, Ravindra K ^a   Kodialam, Murali ^b   Mishra, Ajay K ^c   Orlin, James B ^d  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF PITTSBURGH   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION;

MAXIMUM FLOW ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0031095411     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00269-X     Document Type: Article

References (40)

1. Ahuja, R.K., and Orlin, J.B. (1989), "A fast and simple algorithm for the maximum flow problem", Operations Research 37, 748-759.
2. Ahuja, R.K., and Orlin, J.B. (1991), "Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems", Naval Research Logistics 38, 413-430.
3. Ahuja, R.K., and Orlin, J.B. (1996), "Use of representative operation counts in computational testings of algorithms", ORSA Journal of Computing 8/3.
4. Ahuja, R.K., Orlin, J.B., and Tarjan, R.E. (1989), "Improved time bounds for the maximum flow problem", SIAM Journal on Computing 18, 939-954.
5. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. (1993), Network Flows: Theory, Algorithms, and Applications, Prentice Hall, New Jersey.
6. Alon, N. (1990), "Generating pseudo-random permutations and maximum flow algorithms", Information Processing Letters 35, 201-204.
7. Anderson, R.J., and Setubal, J.C. (1993), "Parallel and sequential implementations of maximum-flow algorithms", in: D.S. Johnson and C.C. McGeoch (eds.), Network Flows and Matching: First DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, American Mathematical Society.
8. Badics, T., Boros, E., and Cepek, O. (1993), "Implementing a new maximum flow algorithm", in: D.S. Johnson and C.C. McGeoch (eds.), Network Flows and Matching: First DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, American Mathematical Society.
9. Bertsekas, D.P. (1994), "An auction algorithm for the max-flow problem", Research Report No. LIDS-P-213, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA. To appear in Journal of Optimization Theory and Applications.
10. Cheriyan, J., and Maheshwari, S.N. (1989), "Analysis of preflow push algorithms for maximum network flow", SIAM Journal of Computing 6, 1057-1086.
11. Cheriyan, J., and Hagerup, T. (1989), "A randomized maximum flow algorithm", Proceedings of the 30th IEEE Conference on the Foundations of Computer Science, 118-123.
12. 1/2) operations", Mathematical Methods of Solution of Economical Problems 7, 112-115.
13. Cherkassky, R.V., and Goldberg, A.V. (1995), "On implementing push-relabel method for the maximum flow problem", Research Report, Department of Computer Science, Stanford University, Palo Alto, CA.
14. Cheung, T. (1980), "Computational comparison of eight methods for the maximum network flow problem", ACM Transactions on Mathematical Software 6, 1-16.
15. Derigs, U., and Meier, W. (1989), "Implementing Goldberg's max-flow algorithm: A computational investigation", Zeitschrift für Operations Research 33, 383-403.
16. Dinic, E.A. (1970). "Algorithm for solution of a problem of maximum flow in networks with power estimation", Soviet Mathematics Doklady 11, 1277-1280.
17. Edmonds, J., and Karp, R.M. (1972), Theoretical improvements in algorithmic efficiency for network flow problems, Journal of ACM 19, 248-264.
18. Ford, L.R., Jr., and Fulkerson, D.R. (1956), "Maximum flow through a network", Canadian Journal of Mathematics 8, 399-404.
19. Gabow, H.N. (1985), "Scaling algorithms for network flow problems", Journal of Computer and System Sciences 31, 148-168.
20. 2/3) algorithm for the maximum flow problem", Acta Informatica 14, 221-242.
21. 2n) algorithm for the maximum flow problem", Journal of Computer and System Sciences 21, 203-217.
22. Gallo, G., and Scutella, M.G. (1993), "Toward a programming environment for combinatorial optimization: A case study oriented to max-flow computations", ORSA Journal on Computing 5, 120-133.
23. Glover, F., Klingman, D., Mote, J., and Whitman, D. (1983), "Comprehensive computer evaluation and enhancement of maximum flow algorithms", Applications of Management Science 3, 109-175.
24. Glover, F., Klingman, D., Mote, J., and Whitman, D. (1984), "A primal simplex variant for the maximum flow problem", Naval Research Logistics Quarterly 31, 41-61.
25. Goldberg, A.V., Grigoriadis, M.D., and Tarjan, R.E. (1991), "Efficiency of the network simplex algorithm for the maximum flow problem", Mathematical Programming (A) 50, 277-290.
26. Goldberg, A.V., and Tarjan, R.E. (1986), "A new approach to the maximum flow problem", Proceedings of the 18th ACM Symposium on the Theory of Computing, 136-146. Full paper in Journal of ACM 35 (1988), 921-940.
27. Goldberg, A.V., and Tarjan, R.E. (1986), "A new approach to the maximum flow problem", Proceedings of the 18th ACM Symposium on the Theory of Computing, 136-146. Full paper in Journal of ACM 35 (1988), 921-940.
28. Goldfarb, D., and Grigoriadis, M.D. (1988), "A computational comparison of the Dinic and network simplex methods for maximum flow", Annals of Operations Research 13, 83-123.
29. 2m) time", Mathematical Programming 47, 353-365.
30. Goldfarb, D., and Hao, J. (1991), "On strongly polynomial variants of the network simplex algorithm for the maximum flow problem", Operations Research Letters 10, 383-387.
31. Hamacher, H.W. (1979), "Numerical investigations on the maximal flow algorithm of Karzanov", Computing 22, 17-29.
32. Imai, H. (1983), On the practical efficiency of various maximum flow algorithms, Journal of the Operations Research Society of Japan 26, 61-82.
33. Karzanov, A.V. (1974), "Determining the maximal flow in a network by the method of preflows", Soviet Mathematics Doklady 15, 434-437.
34. Klingman, D., Napier, A., and Stutz, J. (1974), "NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems", Management Science 20, 814-821.
35. 3) algorithm for finding maximum flows in networks", Information Processing Letters 7, 277-278.
36. Mazzoni, G., Pallottino, S., and Scutella, M.G. (1991), "The maximum flow problem: A max-preflow approach", European Journal of Operational Research 53, 257-278.
37. Nguyen, Q.C., and Venkateshwaran, V. (1993), "Implementations of the Goldberg-Tarjan maximum flow algorithm", in: D.S. Johnson and C.C. McGeoch (eds.), Network Flows and Matching: First DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, American Mathematical Society.
38. 2I) maximum flow algorithm", Technical Report, STAN-CS-78-702, Computer Science Department, Stanford University, Stanford, CA.
39. Sleator, D.D., and Tarjan, R.E. (1983), "A data structure for dynamic trees", Journal of Computer and Systems Sciences 24, 362-391.
40. Tarjan, R.E. (1983), Data Structures and Network Algorithms, SIAM, Philadelphia, PA.