312.253 (21W) Combinatorial Optimization, exercises
Überblick
Weitere Informationen zum Lehrbetrieb vor Ort finden Sie unter: https://www.aau.at/corona.
- Lehrende/r
- LV-Titel englisch Combinatorial Optimization, exercises
- LV-Art Übung (prüfungsimmanente LV )
- LV-Modell Präsenzlehrveranstaltung
- Semesterstunde/n 1.0
- ECTS-Anrechnungspunkte 2.0
- Anmeldungen 14 (25 max.)
- Organisationseinheit
- Unterrichtssprache Englisch
- LV-Beginn 11.10.2021
- eLearning zum Moodle-Kurs
Zeit und Ort
LV-Beschreibung
Intendierte Lernergebnisse
After successful completion of the course, students will be able to solve problems in the area of combinatorial optimization.
Lehrmethodik
Solving assignments and presenting the results, coding exercises.
Inhalt/e
See lecture.
Erwartete Vorkenntnisse
See lecture.
Literatur
See lecture.
Prüfungsinformationen
Geänderte Prüfungsinformationen (COVID-19 Ausnahmeregelung)
In case in-person classes are not permitted, the exercises are held online.
Change as of 11 November 2021: Students who cannot come to class due to not satisfying the 2G or 2G-Bridge, have to upload their solutions until Friday noon before the exercise class in Moodle. A short online meeting with those students takes place Friday afternoon, where they might have to present a randomly chosen exercise.
Prüfungsmethode/n
Solving assignments and presenting the results.
Prüfungsinhalt/e
Assignments of the material from the lecture.
Beurteilungskriterien/-maßstäbe
- The assignments are handed out via Moodle a week before the session.
- Assignment points:
Until 10:00 on the day of the exercise class, you may select online any problem that you have completed. You have then indicated both your thorough understanding and your willingness to present any problem you have selected. When we are ready to discuss a given problem during class, the presenting student will be selected randomly.
For the assignment points, your best 10 sessions are counted. For each session, the number of points you receive equals the number of solved problems (as indicated by your selections) divided by the number of problems discussed in that session.
- In case of honor code violation (e.g. selecting problems without showing up for class, selecting problems without having solved and understood it), all assignment points of the semester are multiplied by 3/4 (in geometric sequence in case of repeated violation) and/or all points of the corresponding session are deleted.
- Presentation points:
- Each presentation is worth 4 points; the arithmetic mean of these presentations yields the presentation points.
Points are awarded for correctness, clarity, brevity, originality, etc.
Coding points:
Coding points are obtained if the code presented is flawless and well documented.
Unregistration is possible until November 8. After this date, students get a grade in any case.
Beurteilungsschema
Note BenotungsschemaPosition im Curriculum
- Masterstudium Mathematics
(SKZ: 401, Version: 18W.1)
-
Fach: Discrete Mathematics
(Wahlfach)
-
6.3 Combinatorial Optimization (
1.0h UE / 2.0 ECTS)
- 312.253 Combinatorial Optimization, exercises (1.0h UE / 2.0 ECTS)
-
6.3 Combinatorial Optimization (
1.0h UE / 2.0 ECTS)
-
Fach: Discrete Mathematics
(Wahlfach)
- Masterstudium Technische Mathematik
(SKZ: 401, Version: 13W.1)
-
Fach: Diskrete Mathematik
(Wahlfach)
-
Kombinatorische Optimierung (
1.0h UE / 2.0 ECTS)
- 312.253 Combinatorial Optimization, exercises (1.0h UE / 2.0 ECTS)
-
Kombinatorische Optimierung (
1.0h UE / 2.0 ECTS)
-
Fach: Diskrete Mathematik
(Wahlfach)