Abstract
This paper describes Fortran subroutines for computing approximate solutions to the weighted MAX-SAT problem using a greedy randomized adaptive search procedure (GRASP). The algorithm (Resende, Pitsoulis, and Pardalos, in: D.Z. Du et al. (Ed.), Satisfiability problem: Theory and Applications, Vol. 35 DIMACS Series on Discrete Mathametics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 1997, pp. 393–405) is briefly outlined and its implementation is discussed. Usage of the subroutines is considered in detail. The subroutines are tested on a set of test problems, illustrating the tradeoff between running time and solution quality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
