Exercise class for the course "Combinatorial Optimization"

Winter Term 2017/18

Tuesdays, from 16:00 (s.t.) to 17:30 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
Sample graph class
Graphs in DIMACS format
Maximal matchings in the graphs above
Cardinalities of maximum matchings of the graphs above

Programming exercise 2:

Programming exercise specification
TSPLIB documentation (includes known optima)
TSPLIB instances

Other resources:

Handout of first exercise (including programming guidelines)

Current news:

On Tuesday, November 7th, there will be an additional exercise class instead of a lecture. It will take place in the Hörsaal.
On Tuesday, January 30th, due to exams there will be no exercise class.

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 two 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: Jannik Silvanus