Warning! The directory is not yet complete and will be amended until the beginning of the term.
052312 VO Computational Optimisation (2019W)
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).
Details
Language: English
Examination dates
Lecturers
Classes (iCal) - next class is marked with N
- Monday 07.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 14.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 21.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 28.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 04.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 11.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 18.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 25.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 02.12. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 09.12. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 16.12. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 13.01. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
- Monday 20.01. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
Information
Aims, contents and method of the course
Assessment and permitted materials
Exam at the end of the semester
Minimum requirements and assessment criteria
Half of the possible points at the exam must be achieved to pass the course.
Examination topics
See contents
Reading list
Any introductory textbook on integer programming/combinatorial optimization should cover most/all of the topics.
Association in the course directory
Module: SWI STW CO
Last modified: Mo 09.11.2020 08:47
Topics addressed include:
- Mathematical Programming
- Discussion of various classical discrete optimization problems (facility location, traveling salesperson, ...)
- Theory of NP-completeness
- Metaheuristics and Mathheuristics
- Problems on Graphs and Networks (Maximum Flow, Spanning/Steiner tree and variants)
- Nonlinear Optimization Methods (e.g., Frank-Wolfe Method)This course is done as lecture; there is an accompanying exercise-part as an own course, students are encouraged to take both courses in the same semester.