|Αλγόριθμοι και Συνδυαστική Βελτιστοποίηση|
|Title: ||Αλγόριθμοι και Συνδυαστική Βελτιστοποίηση|
|Lesson Code: ||321-10001|
|Theory Hours: ||3|
|Lab Hours: |
|Faculty: ||Kaporis Alexios|
Mathematical modeling of combinatorial optimization problems, in the realm of areas such as Biology, Networks, time-dependent processes, resources allocation, game theory, etc. Study of techniques to tackle such problems, as branch and bound, heuristics, probabilistic techniques. Exploiting the limitations of these techniques and case study of resent developments. Dynamic programming and approximation algorithms. Polynomial time approximation schemes. Local search methods, PLS- -completeness, neighborhood structures. Local search methods in the perspective of game theory.
Mathematical modeling of combinatorial optimization problems from a variety of areas and how to tackle these via algorithms.
Algorithms and complexity
Combinatorial optimization: algorithms and complexity. C. Papadimitriou, K. Steiglitz
Polyhedra and Efficiency. Schrijver, Alexander
Journal of combinatorial optimization
|Learning Activities and Teaching Methods |
Work in classroom. Final exams.
|Assessment/Grading Methods |
Lectures: 39 hours
Lab-based exercises: 20 hours
Personal study: 62 hours
Mid-term examination: 1 hour
Final examination: 3 hours
Total: 125 hours (5 ECTS
|Language of Instruction|
|Greek, English (for Erasmus students)|
|Μode of delivery |