期刊
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
卷 27, 期 4, 页码 456-464出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/504210.504214
关键词
algorithms; performance; combinatorial optimization; feedback set problems; graph bipartization; local search; GRASP; FORTRAN subroutines
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据