Paper Info
Title
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP
Abstract
We propose FORTRAN subroutines for approximately solving the feedback vertex and arc set problems on directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). Implementation and usage of the package is outlined and computational experiments are reported illustrating solution quality as a function of running time.
Year
DOI
Venue
2001
10.1145/504210.504214
ACM Trans. Math. Softw.
Keywords
Field
DocType
grasp,feedback set problem,illustrating solution quality,feedback vertex,feedback set problems,approximate solution,fortran subroutine,arc set problem,graph bipartization,greedy randomized adaptive search,fortran subroutines,computational experiment,combinatorial optimization,local search,computer experiment,directed graph,greedy randomized adaptive search procedure
Mathematical optimization,GRASP,Subroutine,Vertex (geometry),Computer science,Fortran,Algorithm,Directed graph,Theoretical computer science,Combinatorial optimization,Local search (optimization),Greedy randomized adaptive search procedure
Journal
Volume
Issue
ISSN
27
4
0098-3500
Citations 
PageRank 
References 
11
1.09
9
Authors
3
Name
Order
Citations
PageRank
Paola Festa128725.32
Panos M. Pardalos23720397.84
Mauricio G. C. Resende33729336.98