Stochastic simulated annealing for directed feedback vertex set

S.​Russo, Luís M.; Castro, Daniel; Ilić, Aleksandar; Romano, Paolo; Correia, Ana D.

doi:10.1016/j.asoc.2022.109607

Cited by 4 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

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%

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem

Zhang,

Du,

et al. 2024

AAAI

View full text Add to dashboard Cite

As a classical NP-hard problem and the topic of the PACE 2022 competition, the directed feedback vertex set problem (DFVSP) aims to find a minimum subset of vertices such that, when vertices in the subset and all their adjacent edges are removed from the directed graph, the remainder graph is acyclic. In this paper, we propose a threshold-based responsive simulated annealing algorithm called TRSA for solving DFVSP. First, we simplify the problem instances with two new reduction rules proposed in this paper and eight reduction rules from the literature. Then, based on a new solution representation, TRSA solves DFVSP with a fast local search procedure featured by a swap-based neighborhood structure and three neighborhood acceleration strategies. Finally, all these strategies are incorporated into a threshold-based responsive simulated annealing framework. Computational experiments on 140 benchmark instances show that TRSA is highly competitive compared to the state-of-the-art methods. Specifically, TRSA can improve the best known results for 53 instances, while matching the best known results for 79 ones. Furthermore, some important features of TRSA are analyzed to identify its success factors.

show abstract

Section: Introductionmentioning

confidence: 99%

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem

Zhang,

Du,

et al. 2024

AAAI

View full text Add to dashboard Cite

show abstract

“…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%

MIP formulations for induced graph optimization problems: a tutorial

Melo

Ribeiro

2023

Int Trans Operational Res

View full text Add to dashboard Cite

Given a graph G=false(V,Efalse)$G=(V,E)$ and a subset of its vertices V′⊆V$V^{\prime }\subseteq V$, the subgraph induced by V′$V^{\prime }$ in G is that with vertex set V′$V^{\prime }$ and edge set E′$E^{\prime }$ formed by all the edges in E linking two vertices in V′$V^{\prime }$. Mixed integer programming (MIP) approaches are among the most successful techniques for solving induced graph optimization problems, that is, those related to obtaining maximum or minimum (weighted or not) induced subgraphs with certain properties. In this tutorial, we provide a literature review of some of these problems. Furthermore, we illustrate the use of MIP formulations and techniques for solving combinatorial optimization problems involving induced graphs. We focus on compact formulations and those with an exponential number of constraints that can be effectively solved using branch‐and‐cut procedures. More specifically, we revisit applications of their use for problems of finding induced forests (which correspond to the complement of feedback vertex sets), trees, paths, as well as quasi‐clique partitionings.

show abstract

Scenario-based multi-objective optimization strategy for rural PV-battery systems

Yuan

Yang

2023

Applied Energy

View full text Add to dashboard Cite

Stochastic simulated annealing for directed feedback vertex set

Cited by 4 publications

References 23 publications

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem

MIP formulations for induced graph optimization problems: a tutorial

Scenario-based multi-objective optimization strategy for rural PV-battery systems

Contact Info

Product

Resources

About