Integer Linear Programming (ILP) is a powerful and versatile tool for solving problems with discrete choices and constraints. In principle, any problem in NP can be encoded as an ILP, making ILP a remarkably general framework for computational problem-solving. While this is true for all NP-complete problems, modern ILP solvers, such as Gurobi or CPLEX, allow your ILP formulations to be solved with continuously updated algorithms backed by competitive research from industry.
Moreover, once you understand the basics, ILPs are remarkably expressive and designing an ILP can be an enjoyable puzzle in and of itself.
By the end of the course, students will be able to:
* Read and understand ILP formulations written by others.
* Understand the utility of ILP for Bioinformatics problems in particular.
* Design simple ILPs for problems of their own.
* Make small changes to an existing ILP to achieve a particular goal.
* Have an intuition for whether an ILP formulation is likely to be efficient.
| Rhythmus | Tag | Uhrzeit | Format / Ort | Zeitraum | |
|---|---|---|---|---|---|
| wöchentlich | Mi | 10-12 | U10-146 | 12.10.2026-05.02.2027 |
| Modul | Veranstaltung | Leistungen | |
|---|---|---|---|
| 39-Inf-AB Algorithmen der Bioinformatik | Ausgewähltes Seminar zu Algorithmen der Bioinformatik | Studienleistung
|
Studieninformation |
| 39-Inf-SAB_a Spezielle Algorithmen der Bioinformatik | Ausgewähltes Seminar zu Spezielle Algorithmen der Bioinformatik | Studienleistung
|
Studieninformation |
| 39-Inf-WP-AP-x Algorithmen & Programmierung (Schwerpunkt) | Vertiefendes Seminar | Studieninformation | |
| - | benotete Prüfungsleistung | Studieninformation | |
| 39-Inf-WP-CLS-x Computational Life Sciences (Schwerpunkt) | Vertiefendes Seminar | Studieninformation | |
| - | benotete Prüfungsleistung | Studieninformation |
Die verbindlichen Modulbeschreibungen enthalten weitere Informationen, auch zu den "Leistungen" und ihren Anforderungen. Sind mehrere "Leistungsformen" möglich, entscheiden die jeweiligen Lehrenden darüber.