Hyperplane Search Algorithms for the Solution of Integer Programming Problems

An algorithm is presented for solving all-integer linear programming problems which successively searches hyperplanes parallel to the optimal hyperplane containing the solution to the associated linear programming problem with the integer restrictions suppressed. These hyperplanes are searched for integer solution points using a dynamic programming formulation. Numerical examples of this technique and some computational results are also presented.