This course aims to provide undergraduate students with all the necessary knowledge that will enable them to understand the fundamentals of Integral Programming and Combinatorial Optimization, how to model realistic problems in engineering, as well as the structure of algorithms in order to solve them.

• Modeling and solution approaches for mixed integer linear programming problems.
• Intelligent uses of binary variables in modeling approaches.
• Branch and bound solution method for mixed integer linear problems.
• Cutting planes method.
• Design and analysis of combinatorial optimization algorithmic approaches.
• Complexity of algorithms.
• Applications to networks and graphs. Problem solving using local optimization techniques, dynamic programming, myopic algorithms, approximations and heuristic methods.

Suggested Literature :

Books in Greek

• Βασιλείου Π.Χ., (2001). Εφαρμοσμένος Μαθηματικός Προγραμματισμός. Εκδόσεις Ζήτη.
• Μηλιώτης Π., (1998). Συνδυαστική Βελτιστοποίηση. Εκδόσεις Σταμούλη.
• Πραστάκος Γ., (2000). Διοικητική Επιστήμη: Λήψη Επιχειρησιακών Αποφάσεων στην Κοινωνία της
  Πληροφορίας. Εκδόσεις Σταμούλη.
• Σίσκος Γ., (2000). Γραμμικός Προγραμματισμός. Εκδόσεις Νέων Τεχνολογιών.

Books in English:

• Nemhauser G.L. and Wolsey L.A., (1988). Integer and Combinatorial Optimization. John Wiley & Sons.
• Cook W.J., Schrijver A., Cunningham W.H. and Pulleyblank W.R., (1997). Combinatorial Optimization.
  John Wiley & Sons.
• Schrijver A., (1998). Theory of Linear and Integer Programming. John Wiley & Sons.
• Papadimitriou C.H. and Steiglitz K., (1998). Combinatorial Optimization: Algorithms and Complexity.
  Dover Publications.
• Wolsey L.A., (1998). Integer Programming. John Wiley & Sons.

Related Academic Journals:

•  Operational Research
• OR spectrum
• Global Optimization
• Mathematical Programming
• Annals of OR

Greek

Lectures