ALGORITHM 769 - FORTRAN SUBROUTINES FOR APPROXIMATE SOLUTION OF SPARSE QUADRATIC ASSIGNMENT PROBLEMS USING GRASP

Citation
Pm. Pardalos et al., ALGORITHM 769 - FORTRAN SUBROUTINES FOR APPROXIMATE SOLUTION OF SPARSE QUADRATIC ASSIGNMENT PROBLEMS USING GRASP, ACM transactions on mathematical software, 23(2), 1997, pp. 196-208
Citations number
8
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Computer Sciences",Mathematics,"Computer Science Software Graphycs Programming",Mathematics
ISSN journal
0098-3500
Volume
23
Issue
2
Year of publication
1997
Pages
196 - 208
Database
ISI
SICI code
0098-3500(1997)23:2<196:A7-FSF>2.0.ZU;2-Q
Abstract
We describe Fortran subroutines for finding approximate solutions of s parse instances of the Quadratic Assignment Problem (QAP) using a Gree dy Randomized Adaptive Search Procedure (GRASP). The design and implem entation of the code are described in detail. Computational results co mparing the new subroutines with a dense version of the code (Algorith m 754, ACM TOMS) show that the speedup increases with the sparsity of the data.