MODULE TYPE: SDG11 

MODULE DESCRIPTION

Models and algorithms used to solve (combinatorial) optimization problems that appear in network (telecommunications, transport, etc) design problems.
Basic concepts: flows, cuts, paths, etc.
Discussion of formulations.
Solution techniques: relaxations, cutting planes, and heuristics.
Network design with a high level of service: availability, reliability, survivability.

LEARNING OUTCOMES

» Recognize the existence of several network topologies, know how to develop models, and know how to solve combinatorial optimization problems.

» Develop models for various topologies. As an example, for tree topologies, the cut models, subcircuit models, and flow models. Develop models for topologies with a high level of service: survivability, availability, reliability.

» Apply techniques to solve combinatorial and integer optimization problems, such as relaxations, cutting planes, and heuristics.

Degree level: Master

Language: English

Study mode: Online

SDG11 Theme: Transport and mobility

ECTS: 3

Semester: Autumn

Starting date: 04-10-2021

Finishing date: 19-11-2021

Enrollment period: Until September, 6th

Participation Form: Fill in the apllication form available here. For further information please send an email to the Admission Office.