Programming Background: The course involves solving programming assignments in Python. You must be comfortable with Python programming. This includes basic control structures in Python: conditional ...

We will introduce approximation algorithms for solving NP-hard problems. These algorithms are fast (often greedy algorithms ... We present integer linear programming formulation and a simple yet ...

In this course, we will introduce various algorithmic techniques used for solving optimization problems such as greedy algorithms, local search, dynamic programming, linear programming (LP), ...