
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Integer Programming and Network Flows covers the theory and practice of integer programming and network flows. The book discusses the relationship between integer programming and network flows, and how to solve integer programming problems using network flow algorithms. It also covers the theory of network flows, including the max-flow min-cut theorem, and its applications to integer programming.
This text investigates the mathematical foundations and algorithmic solutions for integer programming problems and their relationship to network flow theory. Te Chiang Hu, a recognized authority in combinatorial optimization, provides a rigorous examination of how discrete variables and network constraints interact within optimization models. The book establishes a framework for understanding the complexity of integer solutions and the efficiency of flow-based algorithms in solving real-world logistical and computational problems.
What You Will Find
Experts frequently cite this work as a foundational text for students and practitioners in operations research and discrete mathematics. Readers often note the technical density of the prose, which requires a strong background in linear algebra and graph theory to fully grasp the presented methodologies.
Page Count:
452
Publication Date:
1969-06-01
Publisher:
Addison-Wesley Pub Co
ISBN-10:
0201030039
ISBN-13:
9780201030037
No comments yet. Be the first to share your thoughts!