Integer and Combinatorial Optimization
This advanced text/reference is the most current, comprehensive treatment on the topic available. Presents the mathematical foundations of integer and combinatorial optimization models and the algorithms that can be used to solve a rich variety of problems in resource allocation, location, distribution, scheduling, and production. Includes chapters on polyhedral theory and model formulation with integer variables. Part I covers linear programming, graphs and networks, and computational complexity. Part II covers integer programming, including duality, relaxation and strong cutting planes, and presents algorithms. Part III addresses combinatorial optimization, including 0-1 matrices, matching, and submodular function optimization. Contains many examples and applications.--This text refers to an out of print or unavailable edition of this title.