IEE 598 is a second course in combinatorial and discrete optimization. It develops integer programming models and solution techniques; complexity results related to these; heuristic solution techniques; and applications.

Students are expected to have an introductory course in linear optimization including linear programming. Background in design and analysis of algorithms will be useful, but not required.

Course Information:	IEE 598:  Optimization II  http://www.public.asu.edu/~ccolbou/src/iee598.html
Class Meeting Time:	T Th 1:40-2:55  GWC 573
Instructor:    Office Hours:	Charlie Colbourn Office:  Brickyard 444 or Goldwater 560  Charles.Colbourn@asu.edu Mondays 11:30-12:30 in 560 GWC, Thursdays 9:30-10:30 in 444 BY.
Prerequisites:	Optimization I (Linear Programming)
Special Needs:	If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.
Academic Honesty:	Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While you are welcome to discuss academic problems with others, it is not acceptable to discuss solutions with them. If in doubt about anything related to academic integrity, see the instructor.
TextBooks:
Required Text:	G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, Wiley-Interscience, 1999.
Other readings:	For specific topics, additional readings may be provided as the semester progresses.