Paper Info
Title
Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
Abstract
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 (Algorithm 754, ACM TOMS) show that the speedup increases with the sparsity of the data.
Year
DOI
Venue
1997
10.1145/264029.264038
ACM Trans. Math. Softw.
Keywords
Field
DocType
grasp,dense version,fortran subroutine,greedy randomized adaptive search,new subroutine,speedup increase,combinatorial optimization,computational result,approximate solution,acm toms,fortran subroutines,sparse instance,sparse quadratic assignment problem,quadratic assignment problem,local search,distance matrix,computer experiment,greedy randomized adaptive search procedure
Mathematical optimization,GRASP,Subroutine,Quadratic assignment problem,Quadratic equation,Algorithm,Fortran,Theoretical computer science,Combinatorial optimization,Distance matrix,Local search (optimization),Mathematics
Journal
Volume
Issue
ISSN
23
2
0098-3500
Citations 
PageRank 
References 
28
3.29
7
Authors
3
Name
Order
Citations
PageRank
Panos M. Pardalos13720397.84
Leonidas S. Pitsoulis217022.11
Mauricio G. C. Resende33729336.98