Integer Linear Programming (ILP), part 2: More Examples + techniques for solving ILPs

This is a "bonus" video on ILPs, where I show you for two algorithmic problems, how to model them as ILP: shortest path and TSP. At the end I briefly discuss techniques for solving ILPs like branch and bound.

00:00 Shortest path as ILP
03:30 Shortest path as LP
05:40 TSP
07:58 MTZ formulation
10:05 DFJ formulation
12:24 Solving ILPs
12:55 Branch and bound
15:33 Cutting Planes