2022
DOI: 10.1016/j.asoc.2022.109607
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic simulated annealing for directed feedback vertex set

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…Zhou (2016) presented a belief propagation-guided decimation (BPD) algorithm to solve DFVSP. Based on SA-FVSP (Galinier, Lemamou, and Bouzidi 2013), Tang, Feng, and Zhong (2017) introduced a nonuniform neighborhood sampling (NNS) strategy, and Russo et al (2022) proposed a stochastic simulated annealing algorithm. Recently, Sun et al (2023) presented an efficient stochastic local search algorithm called IDTS which alternates between a thresholding search stage and a descent stage to solve DFVSP.…”
Section: Introductionmentioning
confidence: 99%
“…Zhou (2016) presented a belief propagation-guided decimation (BPD) algorithm to solve DFVSP. Based on SA-FVSP (Galinier, Lemamou, and Bouzidi 2013), Tang, Feng, and Zhong (2017) introduced a nonuniform neighborhood sampling (NNS) strategy, and Russo et al (2022) proposed a stochastic simulated annealing algorithm. Recently, Sun et al (2023) presented an efficient stochastic local search algorithm called IDTS which alternates between a thresholding search stage and a descent stage to solve DFVSP.…”
Section: Introductionmentioning
confidence: 99%
“…The great interest in such problems is partly due to the numerous practical applications in which they arise and to their intricate and often useful theoretical aspects. Some of the studied induced graph problems include forests (Shi and Xu, 2017; Melo and Ribeiro, 2022), trees (Erdös et al., 1986; Melo and Ribeiro, 2022), paths (Matsypura et al., 2019; Marzo et al., 2022), cycles (Kobayashi and Kawarabayashi, 2009; Pereira et al., 2022), cliques (Feo et al., 1994; Bomze et al., 1999), quasi‐cliques (Abello et al., 2002; Melo et al., 2022), independent sets (Tarjan and Trojanowski, 1977), matchings (Cameron, 1989; Duckworth et al., 2005), regular graphs (Agra et al., 2017), directed acyclic graphs (Russo et al., 2022), among others. Besides, theoretical aspects of induced graphs with more general properties are also studied (Lévêque et al., 2009).…”
Section: Introductionmentioning
confidence: 99%