P. Festa, P. M. Pardalos, and M. G. C. Resende
ACM Transactions on Mathematical Software, vol. 27, pp. 456-464, 2001.
We describe FORTRAN subroutines for approximately solving the
feedback vertex and arc set problems on directed graphs using a Greedy
Randomized Adaptive Search Procedure (GRASP). The algorithms are
described in detail. Implementation and usage of the package is
outlined and computational experiments are reported illustrating
solution quality as a function of running time. The source code
can be downloaded from the URL http://www.research.att.com/~mgcr/src/gfsp.tar.gz.
PostScript file of full paper
PDF file of full paper
Mauricio G.C. Resende's Home PageLast modified: 25 June 2002