Ref Network Flow Theory

Ahuja, R. K., T. L. Magnanti and J. B. Orlin (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New York. (A comprehensive introduction to shortest path, maximum flow, and minimum cost flow problems with descriptions of polynomial-time algorithms for these models as descriptions of important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.)

Antoulas, A. C. (2005). Approximation of Large-Scale Dynamical Systems. SIAM Advances in Design and Control 6. (Book explains how to reduce complex mathematical models in view of limited computational accuracy and storage capabilities and the trade offs between accuracy and complexity.)

0 0

Post a comment