Differences

This shows you the differences between two versions of the page.

--- courses:ko:start [2024/03/27 17:02]
heinzvil [Course overview]
+++ courses:ko:start [2024/04/22 12:22]
heinzvil [Grading]
@@ Line 17: / Line 17: @@
 This course is focusing on the problems and algorithms of combinatorial optimization (often called discrete optimization). Following the courses on linear algebra, graph theory, and basics of optimization, we show optimization techniques based on graphs, integer linear programming, heuristics, approximation algorithms and state space search methods. We focus on application of optimization, e.g. logistics, transportation, planning of human resources, scheduling in production lines, message routing and scheduling in parallel computers. \\
-{{ :courses:ko:2024_ko_photo.zip | Foto}}
+\\
-===== Prerequisities =====
+==== Good memories ====
+ * {{ :courses:ko:2024_ko_photo.zip | Foto}}
+===== (Recommended) Prerequisities =====
 Optimization, Discrete Mathematics, Logics and Graph Theory.
@@ Line 80: / Line 83: @@
 To pass the written exam, it is necessary to get at least 20 points.
 The oral exam is **mandatory**.
+**All students write both theoretical tests and the practical test at given lecture/lab only.** The exception is an illness (confirmed by a sick note from the doctor), planned educational leave like a summer school (confirmation must be provided to your lab teacher weeks in advance), or unforeseen severe events that must accepted by your lab teacher. The substitute terms are at the end of the semester (specific dates will be clarified).
 **Final grading scale**: