4.5 Article

Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP

期刊

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据