A GRASP for satisfiability
Maurício G. C. Resende, Thomas A. Feo · DIMACS series in discrete mathematics and theoretical computer science · 1996
A greedy randomized adaptive search procedure (Grasp) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a Grasp for the satisfiability (SAT) problem. This algorithm can be also directly applied to both the weighted and unweighted versions of the maximum satisfiability (MAX-SAT) problem. We review basic concepts of Grasp: construction and local search algorithms. The implementation of Grasp for the SAT problem is described in detail. Computational experience on a large set of test problems is presented.