Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference29 articles.
1. C. Aggarwal, J. Hao and J.B. Orlin, Diagnosing infeasibilities in network flow problems, MIT Sloan School Working Paper WP # 3696, Cambridge, MA, 1994.
2. R.K. Ahuja, A.V. Goldberg, J.B. Orlin and R.E. Tarjan, Finding minimum-cost flows by double scaling,Math. Programming 53 (1992) 243–266.
3. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms and Applications (Prentice Hall, New York, NY, 1993).
4. F. Barahona and É. Tardos, Note on Weintraub’s minimum cost flow algorithm,SIAM J. Comput. 18 (1989) 579–583.
5. R. Bellman, On a routing problem,Quarterly of Applied Mathematics 16 (1958) 87–90.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献