Project Description

Programma

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 the 9 CFU-program, please contact the Teacher

0 crediti
60 o 90 ore di lezione
0° Anno
Laurea Magistrale
0° semestre