Network Flow Theory, Algorithms and Applications (English Version)

Author: Lavender
Publisher:
Publishing Time: Not Available
Features: This book comprehensively introduces classic and modern network flow technologies, including integrated theory, algorithms, and applications. The main content includes: paths, trees, and cycles, algorithm design and analysis, maximum flow and minimum flow algorithms, assignment and matching, minimum spanning trees, Lagrange relaxation and network optimization, etc. The book contains a large number of exercises to expand its content and facilitate teaching.
Book Features: In-depth introduction to powerful algorithmic strategies and analytical tools, such as data scaling and potential function variables. Discusses important topics and practical solutions in network optimization, such as the Lagrange relaxation method. Includes extensive bibliographical notes, providing valuable historical context and guidance. Contains over 800 exercises of varying difficulty.