Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference28 articles.
1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993).
2. R.K. Ahuja, A.V. Goldberg, J.B. Orlin and R.E. Tarjan, Finding minimum-cost flows by double scaling,Mathematical Programming 53 (1992) 243–266.
3. A.V. Goldberg and R.E. Tarjan, Solving minimum cost flow problem by successive approximation,Mathematics of Operations Research 15 (1990) 430–466.
4. J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm,Operations Research 41 (1993) 338–350.
5. N. Zadeh, A bad network problem for the simplex method and other minimum cost flow algorithms,Mathematical Programming 5 (1973) 255–266.
Cited by
157 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献