Department of Information & Communication Systems Engineering
University of the Aegean
SCHOOL OF ENGINEERING

Department of Information
& Communication Systems Engineering

Information & Communication Systems Security
Information Systems
Artificial Intelligence
Computer & Communication Systems
Geometry, Dynamical Systems & Cosmology
 
Algorithms and Combinatorial Optimization

Title: Algorithms and Combinatorial Optimization
Lesson Code: 321-10001
Semester: 9
ECTS: 5
Theory Hours: 3
Lab Hours:
Faculty: Kaporis Alexios
 
Content outline

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.

 
Learning outcomes

Mathematical modeling of combinatorial optimization problems from a variety of areas and how to tackle these via algorithms.

 
Prerequisites
Not required.
 
Basic Textbooks

Combinatorial optimization: algorithms and complexity. C. Papadimitriou, K. Steiglitz

Combinatorial Optimization
Polyhedra and Efficiency. Schrijver, Alexander

 
Additional References

Journal of combinatorial optimization

 
Learning Activities and Teaching Methods

Work in classroom. Final exams.

 
Assessment/Grading Methods

 

Activity Semester workload
Lectures 39 hours

 
Personal study 83 hours
 
Final exams 3 hours
Course total 125 hours (5 ECTS)
 
Language of Instruction
Greek, English (for Erasmus students)
 
Μode of delivery

Face-to-face



Home | Contact

University Of The Aegean

SCHOOL OF ENGINEERING
Department of Information & & Communications Systems Engineering

© Copyright ICSD :: 2008 - 2017