Integer Programming: Polyhedral Theory and Algorithms

Topic

Integer programming is concerned with optimization problems where some of the variables are restricted to take only integral values. There are numerous applications of integer programming in various areas such as facility location, network design, vehicle routing and so on.

Topics included are:

Modelling with Integer Programs
Polyhedra and Polytopes
Formulations: Good and Ideal
Complexity
Optimization and Separation
Polyhedra and Integer Programming
Integrality of Polyhedra
Total Unimodularity and Total Dual Integrality
(Possible additional topic: Matchings)

Dates

The lecture takes place on Tuesdays 08:15-09:45 in room 48-208 and on Thursdays 08:15-09:45 in room 48-208. Discussion classes are held

Tuesdays, 11:45-13:15, 36-265 (English tutorial)
Tuesdays, 17:15-18:45, 44-380 (German tutorial)

Homework Assignments

Number	Due Date	Postscript	PDF
1	-	uebung1.ps	uebung1.pdf
2	October 30	uebung2.ps	uebung2.pdf
3	November 6	uebung3.ps	uebung3.pdf
4	November 13	uebung4.ps	uebung4.pdf
5	November 20	uebung5.ps	uebung5.pdf
6	November 27	uebung6.ps	uebung6.pdf
7	December 4	uebung7.ps	uebung7.pdf
8	December 11	uebung8.ps	uebung8.pdf
9	December 18	uebung9.ps	uebung9.pdf
10	January 15	uebung10.ps	uebung10.pdf
11	January 22	uebung11.ps	uebung11.pdf
12	January 29	uebung12.ps	uebung12.pdf

Lecture Notes

I am writing lecture notes for the course which are available as

Be warned that these notes are still under construction. They are based on my original writeup for the lecture Integer Programming which you can find on my personal homepage.