Efficient preflow push algorithms

Computers and Operations Research

Volumn 35, Issue 8, 2008, Pages 2694-2708

  Cerulli, R ^a   Gentili, M ^a   Iossa, A ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Maximum flow; Ping pong effect; Preflow push

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

AUGMENTING PATH ALGORITHMS; MAXIMUM FLOW; PING PONG EFFECT; PREFLOW PUSH;

PROBLEM SOLVING;

EID: 36849080857     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.023     Document Type: Article

References (15)

1. Ford L.R., and Fulkerson D.R. Flows in networks (1962), Princeton University Press, Princeton, NJ
2. Goldberg A.V., and Tarjan R.E. A new approach to the maximum flow problem. Proceedings of the 18th annual ACM symposium on theory of computing (1986) 136-146
3. Mazzoni G., Pallottino S., and Scutellà M.G. The maximum flow problem: a max-preflow approach. European Journal of Operational Research 53 (1991) 257-278
4. Derigs U., and Meier W. Implementing Goldberg's max flow algorithm, A computational investigation. Zeitschrif für Operations Research 33 (1989) 383-403
5. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: theory, algorithms, and applications (1993), Prentice-Hall, Englewood Cliffs, NJ
6. Goldberg A.V., and Tarjan R. A new approach to the maximum flow problem. Journal of the Association for Computing Machinery 35 (1988) 921-940
7. Edmonds J., and Karp R.M. Theoretical improvements in algorithmic efficiency for networks flow problem. Journal of the ACM 19 (1972) 248-264
8. Cheriyan J, Maheshwari SN. Analysis of preflow push algorithms for maximum network flow. Lecture notes in computer science, vol. 338. Berlin: Springer; 1988. p. 30-48.
9. Tunçel L. On the complexity of preflow-push algorithm for maximum flow problem. Algorithmica 11 (1994) 353-359
10. Cheriyan J., and Mehlhorn K. An analysis of the highest-level selection rule in the preflow-push max-flow algorithm. Information Processing Letters 69 (1999) 239-242
11. Bertsekas D. An auction algorithm for the max-flow problem. Journal of Optimization Theory and Applications 87 1 (1995) 69-101
12. Johnson DS, McGeoch CC, editors. Network flows and matching: first DIMACS implementation challenge. Providence, R1: AMS, 1993.
13. Goldfarb D., and Grigoriadis M.D. A computational comparison of the dinic and network simplex methods for maximum flow. Annals of Operation Research 13 (1988) 83-123
14. Anderson R.J., and Setubal J.C. Goldberg's algorithm for the maximum flow in perspective: a computational study. In: Johnson D.S., and McGeoch C.C. (Eds). Network flows and matching: first DIMACS implementation challenge (1993), AMS, Providence, RI 1-18
15. Cherkassky BV, Goldberg AV. On implementing the push-relabel method for the maximum flow problem. Algorithmica, 1997; 390-410.