Linear Programming Formulation of the Boolean Satisfiability Problem
published by Moustapha Diaby
in 2016
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.