Courses Bachelor Display 2017-2018
|Course Description||To PDF|
|Course title||Operations Research|
For more information: firstname.lastname@example.org
|Language of instruction||English|
Application of deterministic and stochastic techniques to theoretical and practical optimisation problems in OR.
The course concentrates on algorithmic techniques to approach both theory and practice of problem solving in Operations Research. As a foundation, we start with an introduction to problem encoding and analysis of algorithms and computation times. The focus is then on classical problems from Combinatorial Optimisation, namely shortest path problems, minimum spanning trees, maximum flow and minimum cost flow problems and matching problems. For all problems, one or several algorithms will be discussed and analysed in-depth. Finally, we study the foundations of stochastic processes and Markov Chains, with applications to the analysis of queues and queueing systems
"Network Flows" by Akuja, Magnanti, and Orlin (chapters 2-7, 9, 12, 13). In addition, several chapters of other textbooks in Combinatorial Optimiziation and Operations Research.
Analysis, linear algebra, basic probability theory, linear programming (modelling and solving), programming. Exchange students need to be aware that very specific pre-knowledge is required for this course. A solid background in mathematics is necessary.
|Teaching methods||PBL / Lecture / Assignment / Groupwork|
|Assessment methods||Final Paper / Participation / Written Exam|
|Evaluation in previous academic year||For the complete evaluation of this course please click "here"|
|This course belongs to the following programmes / specialisations||