An O(nm2) time algorithm for solving minimal cost network flow problems

Asia-Pacific Journal of Operational Research

Volumn 20, Issue 2, 2003, Pages 161-175

  Salehi Fathabadi, H ^a   Shirdel, G H ^a  

^a NONE

Author keywords

Complementary slackness conditions; Network flow; Node potentials

Indexed keywords

ALGORITHMS; COSTS; LINEAR PROGRAMMING; PROBLEM SOLVING;

NETWORK FLOW; NODE POTENTIALS;

OPERATIONS RESEARCH;

EID: 0344466642     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. Ahuja, R. K. and J. B. Orlin (1992), The scaling network simplex algorithm, Operations Research 40, supplement 1, S5-S13.
2. Ahuja, R. K., A. V. Goldberg, J. B. Orlin and R. E. Tarjan (1992), Finding minimum-cost flows by double scaling, Mathematical Programming 53, 243-266.
3. Ahuja, R. K., T. L. Magnanti and J. B. Orlin (1993), Network Flows, Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs.
4. Bazaraa, M. S., J. J. Jarvis and H. D. Sherali (1990), Linear Programming and Network Flows, 2nd ed., John Wiley and Sons.
5. Ervolina, T. R. and S. T. McCormick (1990), Canceling most helpful cuts for minimum cost network flow, Faculty of Commerce Working Paper 90-Msc-018, University of British Columbia, Vancouver, Canada.
6. Ervolina, T. R. and S. T. McCormick (1993), Two strongly polynomial cut canceling algorithms for minimum cost network flow, Discrete Applied Mathematics 46, 133-165.
7. Goldberg, A. V. and R. E. Tarjan (1989), Finding minimum-cost circulations by canceling negative cycles, Journal of ACM 36, 873-886.
8. Goldberg, A. V. and R. E. Tarjan (1990), Solving minimum cost flow problem by successive approximation, Mathematics of Operations Research 15, 430-466.
9. Tarjan, R. E. (1991), Efficiency of the primal network simplex algorithm for the minimum-cost circulation problem, Mathematics of Operations Research 16, 272-291.