Description
Book SynopsisDiscrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.
Table of ContentsFOUNDATIONS.
The Scope of Integer and Combinatorial Optimization.
Linear Programming.
Graphs and Networks.
Polyhedral Theory.
Computational Complexity.
Polynomial-Time Algorithms for Linear Programming.
Integer Lattices.
GENERAL INTEGER PROGRAMMING.
The Theory of Valid Inequalities.
Strong Valid Inequalities and Facets for Structured Integer Programs.
Duality and Relaxation.
General Algorithms.
Special-Purpose Algorithms.
Applications of Special- Purpose Algorithms.
COMBINATORIAL OPTIMIZATION.
Integral Polyhedra.
Matching.
Matroid and Submodular Function Optimization.
References.
Indexes.
