1. Network Flows: Theory, Algorithms and Applications,;R. K. Ahuja;Prentice Hall,1993
2. Goldberg's algorithm for maximum flow in perspective: A computatioinal study,;R. J. Anderson;in Network flows and matching: First DIMACS implementation challenge (eds. D. S. Johnson and C. McGeoch),1993
3. A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks,;U. Bahceci;Optimization Letters,2012
4. An improved primal simplex variant for pure processing networks,;M. D. Chang;ACM Transactions on Mathematical Software,1989
5. A primal simplex approach to pure processing networks,;C. H. J. Chen;Management Science,1986