AN ALGORITHM FOR SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS
Shinto K.G . · International Journal of Research in Engineering and Technology · 2013
The paper describes a method to solve an ILP by describing whether an approximated integer solution to the RLP is an optimal solution to the ILP.If the approximated solution fails to satisfy the optimality condition, then a search will be conducted on the optimal hyperplane to obtain an optimal integer solution using a modified form of Branch and Bound Algorithm.