A linear-time transformation of linear inequalities into conjunctive normal form

Abstract

We present a technique that transforms a binary linear programming problem with integral coefficients to a satisfiability problem of propositional logic in linear time. Preliminary computational experience using this transformation, shows that a pure logical solver can be a valuable tool for solving specific binary linear programming problems, namely those that are in a sense ‘almost’ satisfiability problems. In a number of cases it competes favorably with well-known techniques from operations research.