Comparison Between Three Algorithms to Study Their Overall Convergence

Abstract

In this research paper, I presented a new algorithm for solving integer linear programming problems based on previous methods for solving such problems, including the boundary method and Gommari’s truncation algorithm. The two known ones. The new algorithm relies on a coupling process between the two aforementioned methods. The reasons that led to the connection between the branch and node method and the cutting planes method are to overcome some of the disadvantages of the two methods, especially in the case of large repetitions and the large time spent on the solution, and to obtain results that are superior to the results of each of the two methods. It can be said that the new algorithm was characterized by good features and excluded and eliminated many of the bad qualities.