Solving Satisfiability (Sat) Problems Using Integer Linear Problem (Ilp) Solvers Combined With Discrete Lagrangian Method

This paper proposed a novel approach to solving SAT problems by combining Discrete Lagrangian method with ILP solvers. Traditionally when applied to SAT problems, ILP solvers have to start from an initial solution which is far away from the optimal solution. Discrete Lagrangian methods can efficiently obtain an initial solution which is very close to the optimal solution. This paper shows a method to combine their computation advantages in an efficient way.