Integer Programming (Winter Term 2022/2023)

Overview

• Course (3/1/0) consisting of
  • Video lectures as well as flipped classroom meetings with exercises in APB/E010/U on Mondays, 13:00–16:40. See OPAL Page for details
  • Self-study
  • Final Examination
• Lecturer: Silvia Di Gregorio
• Enrolment
• OPAL Page

Contents

The course studies optimization problems over integers, and focuses on the theory behind the algorithms used in state-of-the-art methods for solving such problems. A key topic will be polyhedral formulations of these problems, in particular their algebraic and geometric properties. The students will learn some basic techniques for deriving valid inequalities for integer programming problems, with special attention to the classes that have been used successfully in commercial solvers. If time permits, we will talk about more advanced relaxations and reformulation methods, as well as enumeration methods. Students are suggested to review the main topics of Linear Programming (algorithms, duality and polyhedral theory).