Integer and combinatorial optimization - Nemhauser, George L.; Wolsey, Laurence A. (New York : Wiley, 1999)
Pt. I. Foundations. I.1. The Scope of Integer and Combinatorial Optimization. I.2. Linear Programming. I.3. Graphs and Networks. I.4. Polyhedral Theory. I.5. Computational Complexity. I.6. Polynomial-Time Algorithms for Linear Programming. I.7. Integer Lattices -- Pt. II. General Integer Programming. II.1. The Theory of Valid Inequalities. II.2. Strong Valid Inequalities and Facets for Structured Integer Programs. II.3. Duality and Relaxation. II.4. General Algorithms. II.5. Special-Purpose Algorithms. II.6. Applications of Special-Purpose Algorithms -- Pt. III. Combinatorial Optimization. III.1. Integral Polyhedra. III.2. Matching. III.3. Matroid and Submodular Function Optimization.
"A Wiley-Interscience publication."
Includes index.
Bibliography: p. 721-747.
Keywords: Mathematical optimization; Integer programming; Combinatorial optimization