Combinatorial Optimization (3h)

University of Montpellier


This course was a one-time cover and approached a methodology to tackle a problem from a theoretical point of view. This courses tried to depict the different possible steps from the $\textbf{NP}$-completeness to the study of peculiar cases by way of approximability, parameterized complexity, exponential and subexponential algorithms, ...

Teaching types:

Teaching duties: