A scaling out-of-kilter algorithm for minimum cost flow

Control and Cybernetics

Volumn 34, Issue 4, 2005, Pages 1169-1174

  Ciupalǎ, Laura ^a  

^a TRANSILVANIA UNIVERSITY OF BRASOV   (Romania)

Author keywords

Minimum cost flow; Network flow; Scaling technique; Shortest path

Indexed keywords

EID: 33745270784     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. AHUJA, R., MAGNANTI, T. and ORLIN, J.(1993) Network Flow. Theory, Algorithms and Applications. New Jersey, Prentice Hall.
2. CIUPALǍ, L.(2004) About universal maximal dynamic flows. Annals of University of Bucharest 53 (1), 115-124.
3. CIUREA, E. and CIUPALǍ, L.(2004) Sequential and parallel algorithms for minimum flows. Journal of Applied Mathematics and Computing 15 (1-2), 53-78.
4. CIUREA, E. and CIUPALǍ, L. (2001) Algorithms for minimum flows. Computer Science Journal of Moldova 9 (3), 275-290.
5. HOPPE, B. and TARDOS, E.(1994) Polynomial time algorithms for some evacuation Problems. Proceedings of the Fifth Annual ACM- SIAM Symposium on Discrete Algorithms, 433-441.
6. SOKKALINGAM, P.T., AHUJA, R. and ORLIN, J.(2001) New Polynomial-Time Cycle-Canceling Algorithms for Minimum Cost Flows. http://web.mit.edu/jorlin/www/papers.html