Integer and Combinatorial Optimization

Spring 2019

MATP6620 / ISYE6760


Handwritten notes for MATP6620, not the most legible in places, from Spring 2017.


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:
Back to John Mitchell's homepage | RPI Math | ISYE