Network algorithms and optimisation

1.Course titleNetwork algorithms and optimisation
2.Codem23_w_036
3.Study programme—
4.Organizer of the study programme (unit, institute, department)Faculty of Computer Science and Engineering
5.Degree level (first, second, third cycle)Second cycle
6.Academic year / semester9 / Winter
7.Number of ECTS credits6
8.Teacher
9.Prerequisites for enrolling in the course—
10.Course objectives (competences)The goal of the program is for students to study network algorithms and optimization methods in networks of different types, as well as their application to real problems in communication and other types of complex networks, like information, infrastructure, social and biological networks.
11.Course contentIntroduction to network algorithms and optimization. Representation of various real problems in the form of graphs. Problems of shortest paths, minimum cost and maximum flow. Linear programming, simplex method and duality in network problems. Nonlinear Network Optimization, Convex Network Problems and Network Problems with Integer Constraints. Representation and resolution of various network problems such as routing, resource allocation and topological design. Gradient algorithms in network design. Decomposition techniques. Heuristic and metaheuristic algorithms, such as evolutionary algorithms, swarm intelligence, etc. Optimization using graph neural networks. Case studies such as algorithms and optimization in optical networks, internet, as well as in other real networks: transport, energy, financial, social, etc.
12.Learning methodsПредавања поддржани со презентации преку слајдови, интерактивни предавања, практични вежби, тимска работа, пример случаи, поканети предавачи, самостојна изработка на проектна задача и семинарска работа и електронско учење
13.Total available time6 ECTS x 30 hours = 180 hours
14.Distribution of the available time45 + 15 + 30 + 50 + 40 = 180 hours
15.Forms of teaching activities
15.1.Lectures – theoretical teaching45 hours
15.2.Exercises (laboratory, auditory), seminars, team work15 hours
16.Other forms of activities
16.1.Project assignments50 hours
16.2.Individual assignments30 hours
16.3.Home study40 hours
17.Grading
17.1.Tests45 points
17.2.Seminar paper / project (presentation: written and oral)50 points
17.3.Activity and participation10 points
17.4.Final exam0 points
18.Grading criteria (points / grade)
up to 50 points5 (five) (F)
from 51 to 60 points6 (six) (E)
from 61 to 70 points7 (seven) (D)
from 71 to 80 points8 (eight) (C)
from 81 to 90 points9 (nine) (B)
from 91 to 100 points10 (ten) (A)
19.Requirements for signature and taking the final examcompleted activities
20.Language of instructionMacedonian and English
21.Method of monitoring teaching qualityNULL
22.Literature
22.1.Required literature
1. Pablo Pavon Marino | Optimization of computer networks - modeling and algorithms | Wiley | 2016
2. Terry L. Friesz and David Bernstein | Foundations of network optimization and games | Springer | 2016
3. Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. | Linear Programming and network flows, 4th edition | Wiley | 2010
4. Srikant, Rayadurgam, and Lei Ying | Communication networks: an optimization, control, and stochastic networks perspective | Cambridge University Press | 2014
5. David P. Williamson | Network Flow Algorithms | Cambridge University Press | 2019
6. Konstantinos Poularakis, Leandros Tassiulas, T .V. Lakshman | Modeling and Optimization in Software-Defined Networks | Morgan&Claypool Publishers | 2021
22.2.Additional literature
No. Author Title Publisher Year