Table of Contents:
  • pt. I. 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
  • pt. II. 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
  • pt. III. Combinatorial optimization. Integral polyhedra
  • Matching
  • Matroid and submodular function optimization.