Author:
Bland Robert G.,Jensen David L.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference41 articles.
1. 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.
2. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, “Network flows,” in: G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, eds.,Optimization, Handbooks in Operations Research and Management Science, vol. 1 (North-Holland, Amsterdam 1989).
3. R.K. Ahuja, J.B. Orlin and R.E. Tarjan, “Improved time bounds for the maximum flow problem,”SIAM Journal of Computing 18 (1989) 939–954.
4. D.P. Bertsekas, “A distributed algorithm for the assignment problem,” unpublished manuscript (1979).
5. D.P. Bertsekas “A unified framework for primal-dual methods in minimum cost network flow problems,”Mathematical Programming 32 (1985) 125–145.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An implementation of steepest-descent augmentation for linear programs;Operations Research Letters;2020-05
2. Index;Network Flow Algorithms;2019-09-05
3. Author Index;Network Flow Algorithms;2019-09-05
4. Open Questions;Network Flow Algorithms;2019-09-05
5. Electrical Flow Algorithms;Network Flow Algorithms;2019-09-05