Integer and Combinatorial Optimization
MATP6620 / ISYE6760
Handwritten notes for MATP6620,
not the most legible in places,
from Spring 2017.
Polyhedral theory and cutting planes:
Branch and bound:
Mixed integer nonlinear programming.
- Lecture 24: pages 1-3, 7, 8.
- See also typewritten notes on
- Lecture 25: pages 4-6, 9, 10.
See also a handout on the
job shop scheduling OPL example
from an Interfaces paper by Lustig and Puget,
Trick's powerpoint presentation on
Other approaches using linear programming:
Back to John Mitchell's homepage