Combinatorial Optimization and Integer Programming

Spring 2017

MATP6620 / ISYE6760

Course basics:

Midterm Exam:

Here are the solutions to the 2017 exam. Updated April 3 to give alternative solutions to 1e and 2a.

Scores on the midterm: 98 95 84 84 81 80 78 76 75 69 67 67 66 65 59 58 44

In class on Friday, March 31. You can bring one sheet of handwritten notes. (You can write on both sides, the paper can be no larger than 8.5x11 inches.) The exam will cover everything in class up to March 28.

Here are some old exams.


More information about the final report and the presentation.



(Handwritten notes, not the most legible in places.)


Computational complexity Polyhedral theory and cutting planes: Branch and bound: Semidefinite programming: Decomposition approaches: Mixed integer nonlinear programming. Metaheuristic approaches:

Constraint programming. See also a handout on the job shop scheduling OPL example from an Interfaces paper by Lustig and Puget, and Michael Trick's powerpoint presentation on constraint programming.

Other approaches using linear programming:


Papers and resources:

Most of these pointers do not lead to sites at RPI.
Back to John Mitchell's homepage | RPI Math | ISYE