A preliminary analysis of the Distance Based Critical Node Problem
References (8)
- et al.
A genetic algorithm for a class of Critical Node Problems
Electronic Notes in Discrete Mathematics
(2016) - et al.
Detecting critical nodes in sparse graphs
Computers & Operations Research
(2009) - et al.
Hybrid Constructive Heuristics for the Critical Node Problem
Annals of Operations Research
(2016) - et al.
Local Search Metaheuristics for the Critical Node Problem
Networks
(2016)
Cited by (6)
A fast tri-individual memetic search approach for the distance-based critical node problem
2023, European Journal of Operational ResearchCitation Excerpt :Besides general graphs, Aringhieri, Grosso, Hosteins, & Scatamacchia (2019) presented dynamic programming algorithms for DCNP over special graph classes such as paths, trees, and series-parallel graphs. To solve DCNP approximately, Aringhieri et al. (2016c) performed a preliminary analysis and provided some suggestions on designing heuristic algorithms. Alozie et al. (2022) presented a centrality-based heuristic (CBH) algorithm for DCNP, which combined a backbone-based crossover procedure to generate an offspring solution and a centrality-based neighborhood search to improve it.
Efficient Benders decomposition for distance-based critical node detection problem
2020, Omega (United Kingdom)Citation Excerpt :They formulated the problem as an MILP and proposed an exact algorithm to solve it. Later, Aringhieri et al. [25] considered the development of efficient heuristics to solve DCNDPs. Gillen, et al. [26] addressed DCNDP assuming that there exists some level of misinformation about the network, and compared the performance of the solutions obtained by exact algorithms and the ones provided by heuristics.
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem
2019, Discrete Applied MathematicsThe Critical Node Detection Problem in networks: A survey
2018, Computer Science ReviewCitation Excerpt :We can note that few studies have been conducted especially in the case of general graphs for almost all variants. Examples of the few works dealing with this are [112,113]. It is also interesting to consider different variants on directed graphs, as many real-world networks are modeled by digraphs, for example: web, scheduling networks, research citation networks, transport networks, etc.
A heuristic approach for the distance-based critical node detection problem in complex networks
2022, Journal of the Operational Research SocietyA polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
2019, Optimization Letters