Solving Hard Problems in
Combinatorial Optimization

CSCI 2580, Monday 13:00-15:20
Location CIT 368

Links to lecture slides and assignments can be found on the class schedule.

(You have to load the schedule page via the department's internal web server in order to be able to download the documents.)

April 25, 2011 The final presentations will be from 1pm - 3:30pm in CIT368 on May, 9th. Each group should prepare a 10 minute presentation for class. Your final grades will be determined by your presentation and the quality of your assignments as of May, 9th. There will be no final exam. Carleton will not be available after may 9th to help debug your submissions so please work out all the kinks before then.
Feb 11, 2011 The slides from the Comet tutorial can be found here. Similar to the lecture notes, the slides are only accessible from inside the department.
Jan 31, 2011 The permanent meeting time will be Mondays, 13:00-15:20, in CIT 368
A correction to HW1, all assignments are due at 11:59pm on the Sunday night before class.
Jan 21, 2011 Lectures start on Monday, Jan 31, in CIT 368.
The first class will start one hour late 14:00-16:20. A permanent time change will be discussed.
Course description 
The theory of combinatorial optimization and how it is embodied in practical systems. Explores issues encountered in implementing such systems. Emphasizes the wide variety of techniques and methodologies available, including , , , and , Problems addressed include: scheduling, coloring, traveling salesman tours, and resource allocation.

Prerequisites: CSCI 0320 (CS 32) or CSCI 0360 (CS 36), and basic knowledge of linear algebra.
Contact info 
Professor: Pascal Van Hentenryck
Office: 301
Email: pvh "at"
Office Hours: TBA
TA: Carleton Coffrin
Office: 311
Email: cjc "at"
Office Hours: weekdays 10am - 5pm