Exercise class for the course "Combinatorial Optimization"

Winter Term 2022/23

Tuesday, 16:00-17:30 in the Seminarraum, Research Institute for Discrete Mathematics.

Exercise sets:

Set 1 (deadline changed to October 20)
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
Set 9
Set 10 (Problem 2 was wrong. I fixed it but you will also be awarded some points if you prove that the old version was wrong or if you prove the old statement under the additional assumption that the graph is complete. Sorry for that.)
Set 11
Set 12

Programming Exercise 1 (Deadline: November 24)

Programming Exercise 2 (Deadline: December 22)

Exercise specification
Code example including a graph class, matching algorithm and test instances (Updated graphs to be connected and renamed namespace of given example data.)

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 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.

It is recommended to register in the eCampus course for the lecture.

Tutor: Susanne Armbruster