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 ...
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 ...
The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback