SIGN IN
SIGN UP
Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Panos M. Pardalos
Univ. of Florida, Gainsville
Leonidas S. Pitsoulis
Univ. of Florida, Gainsville
Mauricio G. C. Resende
AT&T Labs, Florham Park, NJ
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 23 Issue 2, June 1997
Pages 196-208
ACM
New York, NY
, USA
table of contents
doi>
10.1145/264029.264038
1997 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 20
· Downloads (cumulative): 587
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
combinatorial algorithms
combinatorial optimization
fortran subroutines
grasp
integer programming
local search
performance
quadratic assignment problem
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder