3-4 hours of lectures per week.
Lecturer
Content
It turns out that integer programming is NP-hard. This means that there are instances which are very hard to solve, and instead of using an exact algorithm one might be forced to use some kind of heuristic to solve the problem. In this course we will study the theory of valid inequalities (used to characterize the ocnvex hull of a set of integral points), the general duality theory for integer programming, and some classical examples of integer programming problems, among those the traveling salesman problem. Furthermore, we will study a few algorithms designed to solve well-structured problems. If time permits, we will also discuss complexity theory in some detail.
Prerequisites
Literature
Evaluation