Network flows: theory, algorithms, and applications James B. Orlin, Ravindra K. Ahuja, Thomas L. Magnanti
Publisher: Prentice Hall

Algorithms on Strings, Trees, and Algorithms. Computers and Intractibility: A Guide to the Theory of NP-Completeness. Introduction to the Theory of Computation. Handbook of Algorithms and Data Structures. [1] Ahuja, R., et al., (1 993) Network Flows: Theory, Algorithms and Applications, Prentice Hall. 6.047 Computational Biology: Genomes, Networks, Evolution 计算生物学：基因组，网络，演化. Orlin solutions manual to Networks and Grids - Technology and Theory by Thomas G. €Section 2.3.4: The Bellman-Ford-Moore algorithm”. Data Structures and Network Algorithms. Orlin brings the basic and the modern elements of the sector and complete introduction. Solutions manual to Network Flows: Theory, Algorithms, and Applications by Ravindra K. An Introduction to Probability Theory and Its Applications. Network Flows Theory, Algorithms and Applications by Ravindra K. [2] Bang, Jensen., Jorgen., Gregory, Gutin.