A survey of problems and algorithms in combinatorial optimization. Topics include integer programming formulation, branch-and-bound and cutting plane algorithms, computational complexity, and polyhedral theory. Prerequisite: IE 5301 or consent of instructor.