Summary: Industrial Engineering & Operations Research, UC Berkeley
IEOR269 Integer Programming and Combinatorial Optimization
Semester: Spring 2009 Instructor: Alper Atamt¨urk
Prerequisite: A good understanding of linear programming.
Instructor: Alper Atamt¨urk (email: atamturk@berkeley.edu)
Lectures: Tue Thr 12:30­2 PM (1174B Etcheverry)
Office hrs: Tue 2­3 PM (4175 Etcheverry)
Textbook: G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization,
Wiley, 1999 (paperback).
Other recommended texts:
1. A. Schrijver, Theory of Linear and Integer Programming, Wiley, 1998.
2. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer, 2003.
3. M. Gr¨otschel, L. Lov´azs, A. Schrijver, Geometric Algorithms and Combinatorial Op-
timization, Springer, 1993.
4. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver, Combinatorial Opti-
mization, Wiley, 1998.
Course web page: http://www.ieor.berkeley.edu/atamturk/ieor269
Course description
This is a graduate course on discrete optimization. The course will survey a selection of
fundamental topics in the area, with an emphasis on polyhedral combinatorics. The topics

Source: Atamtürk, Alper - Department of Industrial Engineering and Operations Research, University of California at Berkeley

Collections: Engineering