By the end of this course students will be able to model discrete optimization problems, analyse them concerning their solution methods, and be able to apply solution methods.

partial online lecture

Introduction + Modeling, Recall on Linear Programming + Simplex Method, Polyhedral Theory, Relaxations, Branch & Bound, Cutting Planes

G.L. Nemhauser, L.A. Wolsey "Integer and Combinatorial Optimization" M.Conforti, G. Cornuejols, G. Zambelli "Integer Programming" L.A. Wolsey "Integer Programming"

Written exam.

All topics from the lecture.

Emphasis is laid on reasonable knowledge of the definitions and facts and thorough understanding of the material of the course including the proofs. In case of partial fulfillment, the grade will be awarded freely depending on the deficiencies shown.