Publisher
Springer Berlin Heidelberg
Reference76 articles.
1. Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Math. Program. 53, 243–266 (1992)
2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
3. Arkin, E.M., Papadimitriou, C.H.: On the complexity of circulations. J. Algorithms 7, 134–145 (1986)
4. Barahona, F., Tardos, E.: Note on Weintraub’s minimum-cost circulation algorithm. SIAM J. Comput. 18, 579–583 (1989)
5. Berge, C., Ghouila-Houri, A.: Programmes, Jeux et Réseaux de Transport. Dunod, Paris (1991)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Envy-Free Resource Sharing on a Temporal Network Using a Minimum Cost Circulation Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021-02-01