Universität Wien

052312 VO Computational Optimisation (2016W)

Details

Language: English

Examination dates

Lecturers

Classes (iCal) - next class is marked with N

Compulsory attendance in the first lecture!

  • Monday 03.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
    Seminarraum 8, Währinger Straße 29 1.OG
  • Monday 10.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
    Seminarraum 8, Währinger Straße 29 1.OG
  • Monday 17.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 24.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 31.10. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 07.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 14.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 21.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 28.11. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 05.12. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 12.12. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 09.01. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 16.01. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 23.01. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
  • Monday 30.01. 18:30 - 20:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG

Information

Aims, contents and method of the course

This course gives an introduction to various topics of Computational Optimisation, with and emphasis on discrete ("combinatorial") problems.
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.

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.
See Moodle for details.

Association in the course directory

Last modified: Mo 07.09.2020 15:30