Algorithm 769
Authors:
Open Access
- 1 June 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 23 (2) , 196-208
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.Keywords
This publication has 7 references indexed in Scilit:
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASPACM Transactions on Mathematical Software, 1996
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- A Parallel Grasp Implementation for the Quadratic Assignment Problem1995
- A greedy randomized adaptive search procedure for the quadratic assignment problem1994
- QAPLIB-A quadratic assignment problem libraryEuropean Journal of Operational Research, 1991
- A More Portable Fortran Random Number GeneratorACM Transactions on Mathematical Software, 1979
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957