ECTS : 3
Volume horaire : 15
Description du contenu de l'enseignement :
Since its emergence as a fundamental discipline in theoretical computer science, discrete optimization, its methods, and the problems it aims to solve have often been accompanied by geometric considerations. This course focuses on these geometric aspects, particularly polyhedral ones, and their algorithmic and structural implications, from foundational paradigms dating back to the 1950s to more recent ones. The questions raised during the study of these various paradigms will be: Where do these geometric aspects come from? How can they be translated into algorithmic and/or combinatorial properties? Throughout these discoveries, open and current research problems on the various topics covered will be mentioned.
Here is a possible list of contents, which might change according to the current trends or the lecturer's inclinations.
Compétence à acquérir :
Knowledge about the geometric aspects underlying optimization problems
Mode de contrôle des connaissances :
It will depend on the number of participants
Bibliographie, lectures recommandées :