Table of Contents

FOUNDATIONS: 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; The Matching Problem; Matroid and Submodular Function Optimization; Notes; Exercises.