Combinatorial Optimization and Integer Programming

Spring 2017

MATP6620 / ISYE6760

Course basics:

Midterm Exam:




(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