A Grasp For Satisfiability (1996)
| Venue: | Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, volume 26 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science |
| Citations: | 29 - 6 self |
BibTeX
@INPROCEEDINGS{Resende96agrasp,
author = {Mauricio G.C. Resende and Thomas and Thomas A. Feo},
title = {A Grasp For Satisfiability},
booktitle = {Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, volume 26 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science},
year = {1996},
pages = {499--520},
publisher = {American Mathematical Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. 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. Key words. Combinatorial optimization, logic, satisfiability, artificial intelligence, local search, Grasp, computer implementation AMS(MOS) subject classifications. 90B80, 90C20, 90C35, 90C27, 65H20, 65K05 1. Introduction. Let x be a Boolean variable, i.e. a variable that takes on only the values true or false, and let a literal be a variable x or its negation...
