10
MILP modeling patterns (big-M, indicator constraints, SOS, piecewise linear)
11
Branch-and-bound / branch-and-cut intuition (bounds, cuts, gaps)
12
Common OR combinatorial problems (assignment, knapsack, set cover)
13
Graph modeling for OR (nodes/arcs, paths, cuts, connectivity)
14
Decomposition methods (Benders, Dantzig–Wolfe / column generation)