This work concerned with introducing a new algorithm for solving integer linear programming problems. The improved algorithm can help by decreasing a calculation the complexity of these problems, an advantages of the proposed method are to reduce the solution time and to decrease algorithmic complexity. Some specific numerical examples are discussed to demonstrate the validity and applicability of the proposed method. The numerical results are compared with the solution of integer linear programming problems by using cutting plane method (Gomory method).
"Modified Surrogate Cutting Plane Algorithm (MSCPA) for Integer Linear Programming Problems,"
Emirates Journal for Engineering Research: Vol. 25:
4, Article 4.
Available at: https://scholarworks.uaeu.ac.ae/ejer/vol25/iss4/4