SIGN IN
SIGN UP
Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Mauricio G. C. Resende
AT&T Bell Labs, Murray Hill, NJ
Panos M. Pardalos
Univ. of Florida, Gainesville
Yong Li
Pennsylvania State Univ., University Park
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 22 Issue 1, March 1996
Pages 104-118
ACM
New York, NY
, USA
table of contents
doi>
10.1145/225545.225553
1996 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 23
· Downloads (cumulative): 466
· Citation Count: 7
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
experimentation
fortran
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