2024/2025
Modern operations research methods
Type:
Mago-Lego
Delivered by:
Department of Applied Mathematics and Informatics
When:
3 module
Online hours:
90
Open to:
students of one campus
Language:
English
ECTS credits:
6
Contact hours:
6
Course Syllabus
Abstract
The course is devoted to heuristic and exact algorithms for combinatorial optimization problems. The prerequisites for this course are graph theory; basic data structures (vector, list, tree, heap, stack, queue etc), algorithms (DFS, BFS, binary search, sort etc) and their complexity; experience in C++ programming.