Roughly, we will cover the following ... applications. Integer Linear Programming: Basics, Branch-and-Bound, Cutting Plane Methods. Combinatorial Optimization: Basics of approximation algorithms.

This module will cover integer linear programming and its use in solving NP-hard (combinatorial optimization) problems. We will cover some examples of what integer linear programming is by formulating ...