| Subject Area | Applications and Foundations of Computer Science |
|---|---|
| Semester | Semester 5 – Fall |
| Type | Elective |
| Teaching Hours | 4 |
| ECTS | 6 |
| Prerequisites |
|
| Course Site | https://eclass.uth.gr/courses/E-CE_U_119/ |
| Course Director |
|
| Course Instructor |
|
| Scientific Responsible |  Stamoulis Georgios, ProfessorE-mail: georges@uth.gr |
|---|---|
| Title | Hellenic Chips Competence Centre (HCCC) |
| Funding Agency | Το HCCC υποστηρίζεται από το Chips JU και τα μέλη του, και συγχρηματοδοτείται από την Ευρωπαϊκή Ένωση και την Ελληνική Κυβέρνηση μέσω του προγράμματος “Ανταγωνιστικότητα” |
| Budget | 326.350,00 |
| Duration | 01/06/2025 – 31/05/2029 |
| Scientific Responsible |  Plessas Fotios, ProfessorE-mail: fplessas@uth.gr |
|---|---|
| Title | Αναλογικός Σχεδιασμός, Δοκιμές και Επαλήθευση |
| Funding Agency | NanoZeta Technologies ltd. |
| Budget | 271.400,00 |
| Duration | 26/01/2021 – 25/01/2028 |
| Scientific Responsible |  Korakis Athanasios, ProfessorE-mail: korakis@uth.gr |
|---|---|
| Title | DIGITAfrica: Towards a comprehensive pan-African research infrastructure in Digital Sciences |
| Funding Agency | ΕΥΡΩΠΑΪΚΗ ΕΝΩΣΗ |
| Budget | 123.125,00 |
| Duration | 16/12/2024 – 31/12/2027 |
| Department of Electrical and Computer Engineering | |
|---|---|
| |
| Tel. | +30 24210 74967, +30 24210 74934 |
| gece ΑΤ uth.gr | |
| PGS Tel. | +30 24210 74933 |
| PGS e-mail | pgsec ΑΤ uth.gr |
| URL | https://www.e-ce.uth.gr/contact-info/?lang=en |
| Subject Area | Applications and Foundations of Computer Science |
|---|---|
| Semester | Semester 5 – Fall |
| Type | Elective |
| Teaching Hours | 4 |
| ECTS | 6 |
| Prerequisites |
|
| Course Site | https://eclass.uth.gr/courses/E-CE_U_119/ |
| Course Director |
|
| Course Instructor |
|
Introduction: Optimization, Problems encountered, Size of Problems, Iterative Algorithms and their Convergence. Basic Properties of Linear Programs: Introduction, Examples of Linear Program Problems, Basic Solutions, The Fundamental Theorem of Linear Programming, Relations to Convexity. Simplex Method: Pivots, Adjacent Extreme Points, Determination of Minimum Feasible Solution.Computational Procedures—Simplex Method: Artificial Variables, Variables with Upper Bounds.Matrix Form of Simplex Method, Revised Simplex Method, Duality: Dual Linear Programs, The Theorem of Duality, Relationto the Simplex Procedure,Sensitivity and Complementarity Slackness, Simplex Dual Method. Primal-Dual Algorithm, Reduction of Linear Inequalities (Redundant Equations, Null Variables, Non-external Variables, Applications).Transportation and Flow Network Problems: The Transportation Problem, Determination of a Basic Feasible Solution, Triangulation of Basis, Simplex Method for Transportation Problems, The Assignment Problem, Basic Network Concepts, Minimum Cost Flowς, Maximum Flow, Primal-Dual Transportation Algorithm, Summary. Karmakar’s Algorithm.
Students will be able to
