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

This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs ...

The paper surveys the progress that has been made with the problem of solving linear programming problems when some or all variables are required to take integer values. It is pointed out that there ...

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

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...