Combinatorial optimization and integer programming form the backbone of decision-making models in which discrete choices must be made under constraints. At its core, integer programming specialises in ...

The total amount of money invested in the project. The total cost includes EU contribution as well as other project costs not covered by EU funding. It is expressed in euros. Amount of money, by way ...

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...

Description: An advanced course on theory and algorithms for integer and mixed integer optimization problems. Convergence of integer programming algorithms, dual relaxations, Benders decomposition, ...