SIGN IN
SIGN UP
Remark on Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
Full Text:
PDF
Buy this Article
Author:
Tim Hopkins
University of Kent, Kent, UK
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 29 Issue 3, September 2003
Pages 349-351
ACM
New York, NY
, USA
table of contents
doi>
10.1145/838250.838258
2003 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 273
· Citation Count: 0
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
integer programming
performance
reliability
reliability and robustness
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