Linear Programming Formulation of the Boolean Satisfiability Problem
Moustapha Diaby · arXiv (Cornell University) · 2008
In this paper, we present a new, graph-based modeling approach and a polynomial-sized linear programming (LP) formulation of the Boolean satisfiability problem (SAT). The approach is illustrated with a numerical example.