Complementi di Ricerca Operativa
Operational Research Complements
The Operational Research Complements course follows the basic course in Operations Research and it concerns algorithmic techniques for mixed-integer linear programs and non-linear programs. In particular, the course deals with implicit enumeration algorithms (branch-and-bound, dynamic programming), polyhedral optimization (cutting planes, branch-and-cut) Lagrangean relaxation and column generation.
The course takes 48 hours of lectures.
The
exam consists in the development of a project, that is in implementing
and testing an algorithm, and
in an oral exam.
For students who are not proficient in programming, the project can be replaced by a seminar on a research paper.
Materiale per il corso / Teaching material
The course is well-suited for the development of a master degree thesis.