Simple generalized maximum flow algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 310-324

  Tardos, Éva ^a   Wayne, Kevin D ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

AUGMENTING PATH; COMBINATORIAL ALGORITHM; EXPONENTIAL TIME; GENERALIZED NETWORKS; MAXIMUM FLOW PROBLEMS; MAXIMUM-FLOW ALGORITHM; POLYNOMIAL-TIME COMBINATORIAL ALGORITHMS; PREFLOW-PUSH ALGORITHMS;

COMBINATORIAL MATHEMATICS;

EID: 84958772811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_24     Document Type: Conference Paper

References (23)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993.
2. Edith Cohen and Nimrod Megiddo. New algorithms for generalized network flows. Math Programming, 64:325-336, 1994.
3. F. Glover, J. Hultz, D. Klingman, and J. Stutz. Generalized networks: A fundamental computer based planning tool. Management Science, 24:1209-1220, 1978.
4. F. Glover and D. Klingman. On the equivalence of some generalized network flow problems to pure network problems. Math Programming, 4:269-278, 1973.
5. F. Glover, D. Klingman, and N. Phillips. Netform modeling and applications. Interfaces, 20:7-27, 1990.
6. A. V. Goldberg, S. A. Plotkin, and É Tardos. Combinatorial algorithms for the generalized circulation problem. Technical Report STAN-CS-88-1209, Stanford University, 1988.
7. A. V. Goldberg, S. A. Plotkin, and É Tardos. Combinatorial algorithms for the generalized circulation problem. Mathematics of Operations Research, 16:351-379, 1991.
8. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988.
9. A. V. Goldberg and R. E. Tarjan. Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM, 36:388-397, 1989.
10. A. V. Goldberg and R. E. Tarjan. Solving minimum cost flow problems by successive approximation. Mathematics of Operations Research, 15:430-466, 1990.
11. D. Goldfarb and Z. Jin. A polynomial dual simplex algorithm for the generalized circulation problem. Technical report, Department of Industrial Engineering and Operations Research, Columbia University, 1995.
12. D. Goldfarb and Z. Jin. A faster combinatorial algorithm for the generalized circulation problem. Mathematics of Operations Research, 21:529-539, 1996.
13. D. Goldfarb, Z. Jin, and J. B. Orlin. Polynomial-time highest gain augmenting path algorithms for the generalized circulation problem. Mathematics of Operations Research. To appear.
14. W. S. Jewell. Optimal flow through networks with gains. Operations Research, 10:476-499, 1962.
15. Anil Kamath and Omri Palmon. Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 502-511, 1995.
16. S. Kapoor and P. M. Vaidya. Speeding up Karmarkar's algorithm for multicommodity flows. Math Programming. To appear.
17. K. Mehlhorn and S. Näher. A platform for combinatorial and geometric computing. CACM, 38(1):96-102, 1995. http://ftp.mpi-sb.mpg.de/LEDA/leda.html
18. S. M. Murray. An interior point approach to the generalized flow problem with costs and related problems. PhD thesis, Stanford University, 1993.
19. K. Onaga. Dynamic programming of optimum flows in lossy communication nets. IEEE Trans. Circuit Theory, 13:308-327, 1966.
20. T. Radzik. Faster algorithms for the generalized network flow problem. Mathe- matics of Operations Research. To appear.
21. T. Radzik. Approximate generalized circulation. Technical Report 93-2, Cornell Computational Optimization Project, Cornell University, 1993.
22. K. Truemper. On max flows with gains and pure min-cost flows. SIAM J. Appl. Math, 32:450-456, 1977.
23. P. Tseng and D. P. Bertsekas. An Ɛ-relaxation method for separable convex cost generalized network flow problems. In 5th International Integer Programming and Combinatorial Optimization Conference, 1996.