SIGN IN
SIGN UP
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Paola Festa
University of Salerno, Baronissi (SA), Italy
Panos M. Pardalos
University of Florida, Gainesville, FL
Mauricio G. C. Resende
AT&T Labs Research, Florham Park, NJ
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 27 Issue 4, December 2001
Pages 456-464
ACM
New York, NY
, USA
table of contents
doi>
10.1145/504210.504214
2001 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 15
· Downloads (cumulative): 524
· Citation Count: 1
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
feedback set problems
fortran subroutines
graph bipartization
grasp
integer programming
local search
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