Nonuniform Neighborhood Sampling Based Simulated Annealing for the Directed Feedback Vertex Set Problem
The feedback vertex set problem (FVSP), a combinatorial optimization problem, finds a set of vertices that intersect all cycles of the directed graph. One of the cutting-edge heuristics for this problem is a simulated annealing (SA)-based algorithm named the SA-FVSP. In this paper, we propose an imp...
Main Authors: | Zhipeng Tang, Qilong Feng, Ping Zhong |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7971901/ |
Similar Items
-
An Efficient Local Search for the Feedback Vertex Set Problem
by: Zehui Shao, et al.
Published: (2013-11-01) -
Weighted minimum feedback vertex sets and implementation in human cancer genes detection
by: Ruiming Li, et al.
Published: (2021-03-01) -
Admissibility and nonuniformly hyperbolic sets
by: Luis Barreira, et al.
Published: (2016-03-01) -
Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem
by: Shuli Hu, et al.
Published: (2019-07-01) -
Dominating Vertex Covers: The Vertex-Edge Domination Problem
by: Klostermeyer William F., et al.
Published: (2021-02-01)