| Lectures and exercises |
hours |
| Topics |
Specific contents |
|
| Problems and Models, Algorithms and Computation |
Course Introduction |
2
|
| Algorithmic Techniques and Problem Solving |
Reasoning by Induction and recursion.
Divide et Impera.
Dynamic Programming.
Greedy Algorithms. |
4
|
| Models in Combinatorial Optimization |
Knapsack.
Graphs as models.
Shortes paths.
Spanning trees.
Flows and cuts. |
10
|
| Linear programming |
Models. Geometric solution in two dimensions. General properties |
4
|
| Simplex method |
ptimal solutions. Unbounded solutions. First phase. Convergence |
12
|
| Duality |
Dual problem. Duality theorems.
Complementarity slackness.
Economic interpretation of dual variables.
Postoptimality. |
8
|
| Total hours for lectures and exercises |
40 |
| for exercises only |
26 |
|
Further educational activities
|
hours
|
| Labs |
|
| Tutorials / Seminars |
|
| Workshops |
|
| Guided tours |
|
| |
|
| Total hours for further educational activities |
0 |
| Total hours |
40
|