Journal
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
Volume 27, Issue 4, Pages 456-464Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/504210.504214
Keywords
algorithms; performance; combinatorial optimization; feedback set problems; graph bipartization; local search; GRASP; FORTRAN subroutines
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
