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

Authors: João Abstract: In this paper we consider a network with $P$ nodes, where each node has exclusive access to a local cost function. Network Flows: Theory, Algorithms, and Applications by Ravindra K. Bringing collectively the classic and the up to date aspects of the subject, this comprehensive introduction to community flows offers an integrative watch of idea, algorithms, and programs. We apply our algorithm to model predictive control (MPC) and to network flow problems and show, through experiments on large networks, that our proposed algorithm requires less communications to converge than prior algorithms. Title: Distributed Optimization With Local Domains: Applications in MPC and Network Flows. Ahuja RK, Magnanti TL, Orlin JB: Network Flows: Theory, Algorithms, and Applications. SOLUTIONS MANUAL TO Network Flows: Theory, Algorithms, and Applications by Ravindra K. ŏ考文献： [1] Ravindra K. Advanced Mathematical Concepts Precalculus with Applications by. Network Flows: Theory, Algorithms, and Applications. The Liang-Kleeman Information Flow: Theory and Applications. INSTRUCTOR SOLUTIONS MANUAL FOR Network Flows: Theory, Algorithms, and Applications by Ravindra K. Ɯ大流问题之增光路径算法的比较：http://blog.csdn.net/fengchaokobe/article/details/7584781. Englewood Cliffs, NJ: Prentice Hall; 1993. Holliday Koffman) Computer Algorithms: Introduction to Design and Analysis ( .. The Ahuja book is excellent if you're interested in the computer programming/algorithms side of things. Orlin, Network Flows: Theory, Algorithms, and Applications.