040974 UK Methods of Decision Support (2016S)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from We 17.02.2016 09:00 to We 24.02.2016 12:00
- Deregistration possible until Mo 14.03.2016 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Thursday 03.03. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 10.03. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 17.03. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 07.04. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 14.04. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 21.04. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 28.04. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 12.05. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 19.05. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 02.06. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 09.06. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 16.06. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 23.06. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
- Thursday 30.06. 13:15 - 14:45 Seminarraum 16 Oskar-Morgenstern-Platz 1 3.Stock
Information
Aims, contents and method of the course
The aim of the course is to get aware of common combinatorial optimization problems arising in the field of operations research and how to solve them. We will consider exact and heuristic solution methods for these problems: branch-and-bound methods, greedy algorithms, local search, simulated annealing, variable neighborhood search, genetic algorithms, dynamic programming. Finally, we will also cover optimization problems with multiple objectives.
Assessment and permitted materials
There is NO compulsory attendance at the lectures.
At the beginning of (most of) the lectures students can volunteer to present their solutions to exercises prepared at home. At the end of the term there will be an (optional) oral exam in case the exercise presentations have not been sufficient or satisfactory. All supporting materials are allowed.
At the beginning of (most of) the lectures students can volunteer to present their solutions to exercises prepared at home. At the end of the term there will be an (optional) oral exam in case the exercise presentations have not been sufficient or satisfactory. All supporting materials are allowed.
Minimum requirements and assessment criteria
Each student has to do at least two exercise presentations (in at least two different topics) in a satisfactory quality. If at the end of the course this goal is not reached there is the optional possibility of attending an oral exam.
Examination topics
All topics covered in the lecture.
Reading list
All necessary material or references to external literature will be made available in moodle.
Association in the course directory
Last modified: Mo 07.09.2020 15:29