SIGN IN
SIGN UP
Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Mauricio G. C. Resende
AT&T Labs Research
Thomas A. Feo
Optimization Alternatives
Stuart H. Smith
ALK Associates, Inc.
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 24 Issue 4, Dec. 1998
Pages 386-394
ACM
New York, NY
, USA
table of contents
doi>
10.1145/293686.293690
1998 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 19
· Downloads (cumulative): 750
· Citation Count: 5
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
fortran subroutines
grasp
integer programming
local search
maximum clique
maximum independent set
performance
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