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 field of mixed integer programming addresses optimisation problems characterised by both continuous and discrete decision variables subject to linear constraints. Traditional exact methods, ...

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 ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.