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.

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

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...

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

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