Courses NonDegree Display 2021-2022
|Course Description||To PDF|
|Course title||Algorithms and Optimisation|
Stan van Hoesel
For more information: email@example.com
|Language of instruction||English|
Students learn how to recognize NP-hard optimization problems, and to formulate them. Moreover, the students learn to select appropriate exact and/or heuristic methods to solve the problems.
We introduce complexity theory. We discuss exact optimization algorithms as well as approximate algorithms for NP-hard problems. Students learn how standard techniques from mathematical programming, combinatorial optimisation, and heuristics and search methodologies work, and learn to read research articles and to give presentations on the subjects.
* L.A. Wolsey Integer Programming (2nd edition, 2021),
Edmund K. Burke and Graham Kendall (eds.) Search Methodologies, Springer, Boston, MA, 2014
* Various research articles
Game theory and Optimization (EBC4188)
|Teaching methods (indicative; course manual is definitive)||PBL / Presentation / Lecture / Papers / Groupwork / Coaching|
|Assessment methods (indicative; course manual is definitive)||Attendance / Presentation|
|Evaluation in previous academic year||For the complete evaluation of this course please click "here"|
|This course belongs to the following programmes / specialisations||