Search

Describes Fortran subroutines for finding approximate solutions of sparse instances of the Quadratic Assignment Problem using a Greedy randomized Adaptive Search Procedure. Description of the design; Use of the subroutines; Relationship between the increase in speed with the sparsity of data.

A GRASP with path relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multistart metaheuristic, where, at each iteration, locally optimal solutions are constructed, each independent of the others. Previous experimental results indicate its effectiveness for solving weighted MAX-SAT instances. Path relinking is a procedure used to intensify the search around good-quality isolated solutions that have been produced by the GRASP heuristic. Experimental comparison of the pure GRASP (without path relinking) and the GRASP with path relinking illustrates the effectiveness of path relinking in decreasing the average time needed to find a good-quality solution for the weighted maximum satisfiability problem. [ABSTRACT FROM AUTHOR]

An abstract of the article "GRASP with path relinking for the weighted MAXSAT problem," by Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis and Mauricio G. C. Resende is presented.