Project Description

Learning objectives

Course content

6 CFU-program:
Basic Graph Theory
Fundamental (easy) Optimization Problems on Graphs: Maximum Spanning Trees, Maximum Flow, Shortest Paths
Linear Programming (LP) and Duality
Algorithms for LP: Simplex methods & Interior point Methods
Applications of Linear programming to the minimum cost flow problem
Fundamental (hard) Optimization Problems on Graphs: Steiner Tree Problem; Integer Multicommodity Flows

As for th3 9 CFU-program, please contact the Professor.

Professor

0 credits
60 or 90 hours
0 year
Master Degree
0 semester