The critical node detection problem in networks: A survey
In networks, not all nodes have the same importance, and some are more important than
others. The issue of finding the most important nodes in networks has been addressed …
others. The issue of finding the most important nodes in networks has been addressed …
[PDF][PDF] A history of metaheuristics
A History of Metaheuristics arxiv:1704.00853v1 [cs.AI] 4 Apr 2017 Page 1 A History of
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …
A fast tri-individual memetic search approach for the distance-based critical node problem
The distance-based critical node problem involves identifying a subset of nodes in a graph
such that the removal of these nodes leads to a residual graph with the minimum distance …
such that the removal of these nodes leads to a residual graph with the minimum distance …
Memetic search for identifying critical nodes in sparse graphs
Critical node problems (CNPs) involve finding a set of critical nodes from a graph whose
removal results in optimizing a predefined measure over the residual graph. As useful …
removal results in optimizing a predefined measure over the residual graph. As useful …
A general evolutionary framework for different classes of critical node problems
We design a flexible Evolutionary Framework for solving several classes of the Critical Node
Problem (CNP), ie the maximal fragmentation of a graph through node deletion, given a …
Problem (CNP), ie the maximal fragmentation of a graph through node deletion, given a …
Multi-objective optimization of critical node detection based on cascade model in complex networks
The critical node detection based on cascade model is a very important way for analyzing
network vulnerability and has recently attracted the attention of many researchers in …
network vulnerability and has recently attracted the attention of many researchers in …
Detecting critical nodes in sparse graphs via “reduce-solve-combine” memetic search
This study considers a well-known critical node detection problem that aims to minimize a
pairwise connectivity measure of an undirected graph via the removal of a subset of nodes …
pairwise connectivity measure of an undirected graph via the removal of a subset of nodes …
Variable population memetic search: A case study on the critical node problem
Population-based memetic algorithms have been successfully applied to solve many difficult
combinatorial problems. Often, a population of fixed size is used in such algorithms to record …
combinatorial problems. Often, a population of fixed size is used in such algorithms to record …
Multi-agent coalition formation by an efficient genetic algorithm with heuristic initialization and repair strategy
In multi-agent systems (MAS), the coalition formation (CF) is an important problem focusing
on allocating agents to different tasks. In this paper, three specific CF problems are …
on allocating agents to different tasks. In this paper, three specific CF problems are …
Efficient methods for the distance-based critical node detection problem in complex networks
An important problem in network survivability assessment is the identification of critical
nodes. The distance-based critical node detection problem addresses the issues of internal …
nodes. The distance-based critical node detection problem addresses the issues of internal …