Approximate solution of weighted MAX-SAT problems using GRASP

Abstract

Computing the optimal solution to an instance of the weighted maximum satissability problem (MAX-SAT) is diicult even when each clause contains at most two literals. In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for computing approximate solutions of weighted MAX-SAT problems. The heuristic is tested on a large set of test instances. Computational experience indicates the suitability of GRASP for this class of problems.