Network Analysis
- Credits: 6
- Ending: Examination
- Range: 2P + 2C
- Semester: winter
- Year: 2
- Faculty of Economic Informatics
Teachers
Included in study programs
Teaching results
The aim of the course is to provide basic knowledge of graph theory, network analysis and application of adequate models and methods. Within the study program Operational Research and Econometrics, the course is aimed at fulfilling the objectives of demonstrating advanced knowledge in the field of operational research. Various scientific methods, procedures and algorithms are combined within the course. Students will gain skills in using network analysis techniques and procedures using Python software.
Upon successful completion of the course, students will acquire the following knowledge:
- basic knowledge of graph theory and the use of graph theory in modeling some economic processes,
- basic knowledge of project management, network analysis and the use of network analysis models in the optimization of consecutive economic and managerial processes,
- basic knowledge of the application of network analysis methods in various economic areas.
Upon successful completion of the course, students will acquire the following skills:
- ability to use basic concepts, techniques and algorithms of graph theory, network analysis, scheduling theory,
- control of corresponding software, software products Excel, Python, specialized software products for planning consecutive processes,
- use the Python programming language to solve their own practical tasks in the field of production planning, logistics ...
Upon successful completion of the course, students will acquire the following competencies:
- practical skills and competencies with the application of methods and algorithms in modeling production processes, logistics processes, data analysis using Python software.
Indicative content
1. Introduction to graph theory, its history, use and properties of graphs, descriptions of graph structure.
2. Acyclic graphs, spanning tree graphs, decision tree graphs, UML.
3. Paths in the graph. Eulerian and Hamiltonian paths and circuits. The problem of the shortest path.
4. Modifications of roads in the graph.
5. Roundabouts. Computational complexity of roundabouts. Optimization, heuristic, and metaheuristic algorithms for solving roundabouts.
6. Flows in graphs.
7. Introduction to project management, main properties of graphs for project management. Node-oriented and edge-oriented graphs and their creation.
8. Project management methods. CPM method.
9. Cost and probabilistic analysis in project management. PERT method. MPM method.
10. Software tools in project management. Use of MS Excel, Python.
11. Scheduling theory. Optimization of production processes on one and more service devices.
12. Location models.
13. Use of graph theory in selected economic problems (production processes, logistics processes…).
Support literature
1. Teória grafov pre ekonómov, Ivan Brezina – Pavel Gežík, Bratislava : Letra Edu, 2018
2. Kvantitatívne metódy projektového riadenia pre ekonómov, Ivan Brezina – Pavel Gežík, Bratislava : Letra Edu, 2020
3. Metódy logistiky prepravy, rozmiestňovania a rozvrhovania, (Aplikácie matematických modelov v jazyku Python), Ivan Brezina – Juraj Pekár – Pavel Gežík, Bratislava : Letra Edu, 2020
4. Sieťová analýza, Ivan Brezina – Pavel Gežík - Zuzana Čičková. Bratislava : Vydavateľstvo EKONÓM, 2012.
5. Kvantitatívne metódy na podporu logistických procesov, Ivan Brezina – Pavel Gežík - Zuzana Čičková. Bratislava : Vydavateľstvo EKONÓM, 2009.
Requirements to complete the course
30% semester seminar work, resp. project,
10% continuous processing of tasks, worksheets resp. case studies.
60% written exam.
Student workload
156 hours.
26 hours of lectures,
26 hours of exercise,
70 hours of self-study in preparation for the exam,
34 hours elaboration of a semester project.
Language whose command is required to complete the course
Slovak, English
Date of approval: 27.03.2024
Date of the latest change: 27.03.2024