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

Formulations of mathematical programs often require that some of the decision variables take only integer values. Consider the formulation You can follow the same steps to identify binary variables.

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

Recall the linear programming problem presented in the "Introduction to Mathematical Programming" chapter. In that problem, a firm produces two products, chocolates and gumdrops, that are processed by ...