everything.study
CO 652

Integer Programming

Graduate

Winter 2009

Topics

  • Cones, convexity and Farkas’ lemma
  • Polyhedral theory
  • Integral polyhedra and total unimodularity
  • Integer-programming formulations
  • Valid inequalities and cutting planes
  • Lift-and-project methods
  • Branch and bound
  • Separation and optimization

Readings

  • Integer and Combinatorial Optimization
    G. Nemhauser and L. Wolsey · recommended
    Wiley, 1988
  • Theory of Integer and Linear Programming
    A. Schrijver · recommended
    Wiley, 1998 as cited on the course page
  • Combinatorial Optimization
    B. Cook, B. Cunningham, B. Pulleyblank and A. Schrijver · recommended
    Wiley, 1998
Sources