An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

An Algorithm for Solving Integer Linear Programming Problems

“…Most ILP solution methodology starts with RLP optimal in In [1], different ILP solution methods are given. In addition to these methods, the hyperplane search methods are explained in [2], [3] and [4]. But the most commonly used methods are Gomory's Cuttingplane Method and Branch and Bound Method.…”