back to search
In 1 fellow students' timetables
You will learn central concepts and algorithms of linear integer optimization and combinatorial optimization. In the module you will analyze mathematical structures that allow efficient solution methods, and you will be able to model real problems as discrete optimization problems and identify special cases that are efficiently solvable.
From the current semester, not binding. You attend one of several groups; the timetable automatically suggests the one with the fewest clashes.
No ratings for this module yet.
Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.
Reviews are automatically checked before they are published.
Official page in TUMonline · Details are not binding.