Advanced Discrete Optimisation

Integer optimization: Polyhedral theory; Cutting planes; Gomory mixed-integer cuts, split cuts and their relation; Lift-and-project;

IP in fixed dimension: Lattices and basis reduction;

Parameterized complexity: fixed-parameter tractability, bounded search, kernelization, dynamic programming, treewidth, color coding, iterative compression, hardness results.

Applications in phylogenetics: phylogenetic trees, agreement forests, SPR distance, phylogenetic networks

The final grade of the course consists of the following components:

- Written exam (100%)

Resit/ Repair opportunities:

In case of an insufficient result, repair opportunities may be offered in accordance with TER Implementation Regulations Art 5, sub 5., for:

- Written exam: written resit

Disclaimer: information may change depending on unforeseen circumstances or measures (see: TER Art 29, sub 4).