NETWORK OPTIMIZATION (updated
of the course is to present basic concepts on network optimization
problems, from modeling, algorithmic and implementation viewpoints.
Reminder of linear programming and graphs. Shortest path problems.
Algorithms for acyclic graphs, Dijkstra’s
and Floyd-Warshall’s algorithms. Flow
problems. Max flow, Ford-Fulkerson algorithm. Matching problems.
Assignment problem. Hungarian algorithm. Use of optimization software
to solve network optimization problems.
For students who attend the course, the exam can be taken by
means of a practical (software) test and a written test (both
scheduled in May).
A student who succeeds in both the above tests will receive a
If a student succeeds in one test but not both, the work done
may be taken into account, but the student will still have to
undertake a written test and the oral test.
Regular exams consist of a written test and an oral test.
take place in Classroom 14. Practical lectures (on optimization software,
indicated with *) take place in Classroom 124 (Computer Science Lab).
- Monday March, 6, 14-16
- Wednesday March, 8, 9-13
- Monday March, 13, 14-16
- Wednesday March, 15, 9-13
- Wednesday March, 22, 9-13
- Monday March, 27, 14-16 (*)
- Monday April, 3, 14-16 (*)
- Monday April, 10, 14-16 (*)
- Wednesday April, 26, 9-13
- Wednesday May, 3, 9-13
- Monday May, 8, 14-16 (* - practical test)
- Wednesday May, 10, 9-13
- Monday May, 15, 14-16
- Wednesday May, 17, 9-13
- Wednesday May, 24, 9-13 (written test)
Office hours (students):
14.30 -- 16, Torre Rossa, room R101. (Prof.
Agnetis will be abroad until April 7.)
Classnotes prepared by the teacher:
Shortest path problems
maximum flow problem (download)
exercises (download) (Exercises 11-15-18-24-34 can be skipped)