Nach positiver Absolvierung der Lehrveranstaltung sind Studierende in der Lage...
- kombinatorische Optimierungsprobleme mithilfe von Constraint Programming (CP) zu modellieren und zu lösen.
- verschiedene Verfahren zur Lösung von CP-Problemen zu implementieren.
- Constraint Programming basics: fundamental concepts, types of domains (finite domains, intervals, sets), constraints, search, branch and bound
- CP modeling techniques: global constraints, redundant constraints, symmetry elimination, special-purpose constraints (e.g., scheduling), modeling of optimization problems, problem reduction
- CP languages/libraries: GECODE, COMET, ...
- Modeling examples: n-Queens, Cryptoarithmetic, Sudoku, Scheduling, Timetabling, ...
- Basic solution methods: propagation, consistency, search
- Advanced solution methods: heuristic methods, hybrid approaches, integration with heuristic/metaheuristic techniques
- Statistical analysis of optimization algorithms
- Lab practice
ECTS-Breakdown:
20 h lectures
2 h lab practice
32 h preparation of assignments
20 h preparation for final oral exam
1 h oral exam and presentation of last assignment
------
75 h overall
The course is blocked. The lecture times will be announced.
