Exercise class for the course "Combinatorial Optimization"

Winter Term 2019/20

Wednesdays, from 16:15 to 17:45 in the Seminarraum, Research Institute for Discrete Mathematics.

Exercise sets:

Set 1
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
Set 9
Set 10
Set 11
Set 12

Programming Exercise 1:

Programming exercise specification
Graphs in DIMACS format
Cardinalities of maximum matchings of the graphs above
Code example including graph class

Programming Exercise 2:

Programming exercise specification
Instances and code example

Solutions are submitted on Thursdays, before the lecture.

Submissions typeset in LaTeX are welcome via email to the tutor, but the same deadline applies.

Solutions may be submitted in groups of up to two students.

There will be either 2 or 3 programming exercises.

Students need to achieve both at least 50 % of the points in the theoretical exercises and at least 50 % of the points in the programming exercises.

Tutor: Stefan Rabenstein