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

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