Paper Info
Title
Approximate Solution Of Weighted Max-Sat Problems Using Grasp
Abstract
. Computing the optimal solution to an instance of the weighted maximum satisfiabilityproblem (MAX-SAT) is difficult even when each clause contains at most two literals. In this paper,we describe a greedy randomized adaptive search procedure (GRASP) for computing approximatesolutions 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.Key words. Combinatorial...
Year
Venue
Field
1996
Satisfiability Problem: Theory and Applications
Maximum satisfiability problem,Mathematical optimization,GRASP,Discrete optimization,Computer science,Greedy randomized adaptive search procedure,Approximate solution
DocType
Volume
Citations 
Conference
35
34
PageRank 
References 
Authors
5.14
2
3
Name
Order
Citations
PageRank
Mauricio G. C. Resende13729336.98
Leonidas S. Pitsoulis217022.11
Panos M. Pardalos33720397.84