Optimization Group


Information

Due to the current situation, lectures will not or just partly take place as a face-to-face event. You can obtain information on this from the respective lecturers and staff, as well as from the specified OLAT- and KIS-links.

 

This site is currently under construction!

General Information

Here you will find the lectures offered by our working group in the current semester.

If you would like to attend a seminar, a proseminar or a reading course during the semester, please contact the supervisor or the use URM. Appointments are then determined in consultation with the participants.

If you are interested in doing your bachelor's or master's thesis in optimization, please contact Prof. Schöbel, Prof. Krumke or Prof. Ruzika.

Important links

  • KIS: dates and lectures
  • URM: registration for exercises
  • OpenOLAT: further information and materials

Lectures in winter term 2020/21

Following lectures are offered during winter term 2020/21 by our working group:

Introductory course to mathematics for students of mathematics and computer science

Content

  • Support of new students of mathematics and computer science within the transition from school to university
  • Matching different educational backgrounds and refreshing some of the important fundamentals of the school subject
  • Introduction to the initially unfamiliar mathematical thinking and working methods as well as the abstract language and form of presentation of mathematics lectures at the university
  • Familiarization with the usual form of lecture and group exercise

Lecturer and staff

Dr. Florentine Kämmerer

Date

05.10.2020 - 16.10.2020

Information

Registration needed via https://www.mathematik.uni-kl.de/vorkurs-anmeldung/
All registered participants will receive detailed informations via E-Mail.

Latest information you find on the web-site of the introductory course

Integer Programming

Content

  • Modelling with integer programming,
  • Polyhedra and polytopes,
  • Complexity,
  • Formulations,
  • Connections between integer programming and polyhedral theory,
  • Integerity of polyhedra: unimodularity, total dual integrality,
  • Matchings,
  • Dynamic programming,
  • Relaxations,
  • Branch-and-Bound methods,
  • Cutting planes,
  • Column generation

Multicriteria Optimization

Content

  • Mathematical Modelling with several objective functions
  • Orderings and notations of optimality
  • Characterization of efficient solutions and nondominated points
  • Scalarization methods and approximation algorithms
  • Multicriteria linear programs
  • Multicriteria combinatorial optimization problems

Lecturer and staff

Prof. Dr. Stefan Ruzika
M.Sc. Tobias Dietz

Remark: Due to the current situation, I will offer this lecture as blended learning. The content is provided on OpenOLAT as script and videos. We will have a weekly meeting in a video chat where we discuss the content. Moreover, we will provide weekly exercises.

Prerequisites:

Linear and Network Optimization, Integer Programming

Information and Material

For further information see the KIS-page of the lecture and the OpenOLAT-page of the lecture

Reading courses, seminars und proseminars

Following supplementing courses are offered during winter term 2020/21 by our working group:

Reading Course

Content

The aim is to gain a basic overview of current research topics. In this respect, the Reading Course prepares for a master's thesis in these subject areas.

Lecturer and staff

Prof. Dr. Stefan Ruzika

Date

by arrangement

If you are interested please send an e-mail to ruzika(at)mathematik.uni-kl.de.

Reading Course

Content

The aim is to gain a basic overview of current research topics. In this respect, the Reading Course prepares for a master's thesis in these subject areas.

Lecturer and staff

Prof. Dr. Sven O. Krumke

Date

by arrangement

If you are interested please send an e-mail to krumke(at)mathematik.uni-kl.de.

Seminar Advanced Topics in Optimization

Content

In this seminar we will discuss advanced topics in optimization. One of the topics is the approximation of arbitrary graph metrics by tree metrics and its algorithmic implications. We will show how to obtain approximation algorithms for NP-hard problems by first „approximating“ the graph by a (randomly selected) tree and the applying exact or approximate methods (such as randomized rounding of Integer Programs) for the problem instance on trees.

Lecturer and Staff

Prof. Dr. Sven O. Krumke

Material

OpenOLAT

Zum Seitenanfang