Using Graph Convolution Neural Networks for Solving Mixed Integer Linear Programs

This paper focuses on an exact algorithm for solving NP-hard combinatorial optimization problems whichfrequently requires significant specialized knowledge and trial and error, especially, Mixed Integer Linear Programs (MILP). This challenging, tedious process can be automated by learning the algorithms instead. In many practical applications, the same optimization problem is tackled again and aga…