Course Syllabus
Lecture Slides
Recordings
IP formulations
LP dual
Dual bounds
Primal bounds
Easy problems
Branch-and-bound
Cutting planes
Branch-and-cut
Problem set 1
Problem set 2
Problem set 3
Problem set 4
Problem set 5
Problem set 6
Logical conditions
Linear programming
Bender's Algorithm Example
Branch and cut for Knapsack