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

Global optimization of nonlinear mixed-integer programming (MINLP) addresses decision problems in which some variables are constrained to take integer values, while the objective function or ...

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