Integer programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many practical ...

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

This paper studies a class of integer programming problems in which squares of variables may occur in the constraints, and shows that no computing device can be programmed to compute the optimum ...