Article ID: | iaor20013475 |
Country: | Netherlands |
Volume: | 100 |
Issue: | 1/2 |
Start Page Number: | 95 |
End Page Number: | 113 |
Publication Date: | Mar 2000 |
Journal: | Discrete Applied Mathematics |
Authors: | Resende Mauricio G.C., Pardalos Panos M., Pitsoulis Leonidas S. |
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 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.