P.M. Pardalos, P.S. Pitsoulis, and M. G. C. Resende
ACM Transactions on Mathematical Software, vol. 23, pp. 196-208, 1997
We describe Fortran subroutines for finding approximate solutions of sparse instances of the Quadratic Assignment Problem (QAP) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation of the code are described in detail. Computational results comparing the new subroutines with a dense version of the code [ACM TOMS (1995)}] show that the speedup increases with the sparsity of the data.
PostScript file of full paper
Mauricio G.C. Resende's Home PageLast modified: 22 November 1995