Ottimizzazione Combinatoria
Combinatorial Optimization
The Combinatorial optimization course is part of the "Analytics and Optimization" curriculum and it is devoted to the design and the analysis of combinatorial algorithms, mainly of polynomial complexity, to solve optimization problems on graphs. The course illustrates specific algorithms for some classical graph optimization problems as well as algorithmic paradigms that can be applied to a wide variety of problems.
The course takes 48 hours of lectures, possibly including some lab sessions.
The exam consists in the development of a project, that is in implementing and testing one or more algorithms, preceded by a short written test and followed by an oral exam. The project can be replaced by the study, presentation and critical discussion of a scientific paper (see below).
The course is well-suited for the development of a master degree thesis.
Materiale per il corso / Teaching material
Suggested papers for the exam (UPDATED)
News and announcements
The Zoom link to contact me is https://us02web.zoom.us/j/9990797905
Students who are willing to take the exam are invited to contact me by e-mail (giovanni.righini@unimi.it)
to possibly start their project or the preparation of a seminar on a research paper.
The last lecture will take place on Monday, January 8th, 2024, at 10:30-12:30 on the fifth floor