DE

Modul

Algorithmic Methods for Hard Optimization Problems [M-INFO-101237]

Credits
5
Recurrence
Unregelmäßig
Duration
1 Semester
Language
German
Level
3
Version
1

Responsible

Organisation

  • KIT-Fakultät für Informatik

Part of

Bricks

Identifier Name LP
T-INFO-103334 Algorithmic Methods for Hard Optimization Problems 5

Competence Goal

The goal of this course is to familiarize the students with hard problems and possible approaches to solve them. Online problems may also be part of the course.

Content

There are many practical problems that cannot be solved optimally - some not at all and some not in a resonable amount of time. An example is the "bin packing problem" where a collection of

objects must be packed using a possibly small number of bins. Moreover, problems sometimes arise where knowledge about the future (or even about the present) is incomplete, but a decision

is required neverthelss ("online problems"). Regarding bin packing, for example, there must be a point in time when you close the bins and send them away. Even if there are some more objects arriving later.