NETWORK OPTIMIZATION (updated
of the course is to present basic concepts on network optimization
problems, from modeling, algorithmic and implementation viewpoints.
Review of graphs and linear programming. Shortest path problems.
Algorithms for acyclic graphs. Dijkstra’s
and Floyd-Warshall’s algorithms. Flow
problems. Max flow, Ford-Fulkerson algorithm. Matching problems.
Maximum matching and node cover. Assignment problem. Hungarian
algorithm. Formulation of decision problems as network optimization.
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, see below).
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.
Course calendar (updated March 14)
take place in Classroom 20. Practical lectures (on optimization
software, indicated with *) take place in Classroom 146 (Computer
- Wednesday March 7, 11-13
- Monday March 12, 9-13
- Wednesday March 14, 11-13
- Monday March 19, 9-13
- Wednesday March 21, 11-13
- Monday March 26, 9-13 (*)
- Wednesday March 28, 11-13 (*)
- Monday April 9, 9-13
- Wednesday April 11, 11-13
- Monday April 16, 9-13
- Wednesday April 18, 11-13 (*)
- Monday April 23, 9-13
- Wednesday May 2, 11-13 (*)
- Monday May 7, 9-13
- Wednesday May 9, 11-13 (* - practical test)
- Monday May 28, 9-13 (written test)
Office hours (students): Tuesday, 14.30 -- 16, Torre Rossa, room R101
Classnotes prepared by the teacher:
Shortest path problems
maximum flow problem (download)
exercises (download) (Exercises 11-15-18-24-34 can be skipped)