The critical node detection problem in networks: A survey
M Lalou, MA Tahraoui, H Kheddouci - Computer Science Review, 2018 - Elsevier
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 …
Literature review: The vaccine supply chain
LE Duijzer, W Van Jaarsveld, R Dekker - European Journal of Operational …, 2018 - Elsevier
Vaccination is one of the most effective ways to prevent and/or control the outbreak of
infectious diseases. This medical intervention also brings about many logistical questions. In …
infectious diseases. This medical intervention also brings about many logistical questions. In …
An integer programming framework for critical elements detection in graphs
This study presents an integer programming framework for minimizing the connectivity and
cohesiveness properties of a given graph by removing nodes and edges subject to a joint …
cohesiveness properties of a given graph by removing nodes and edges subject to a joint …
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 …
Spatial network disintegration based on kernel density estimation
The problem of network disintegration, such as suppression of an epidemic spread and
destabilization of terrorist networks, possesses extensive applications and has lately been …
destabilization of terrorist networks, possesses extensive applications and has lately been …
A general evolutionary framework for different classes of critical node problems
R Aringhieri, A Grosso, P Hosteins… - … Applications of Artificial …, 2016 - Elsevier
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 …
[HTML][HTML] A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem
D Granata, A Sgalambro - Computers & Operations Research, 2023 - Elsevier
This paper considers a Multiple Objective variant of the Critical Disruption Path problem to
extend its suitability in a range of security operations relying on path-based network …
extend its suitability in a range of security operations relying on path-based network …
Optimizing network attacks by artificial bee colony
Over the past few years, the task of conceiving effective attacks to complex networks has
arisen as an optimization problem. Attacks are modelled as the process of removing a …
arisen as an optimization problem. Attacks are modelled as the process of removing a …
Methods for removing links in a network to minimize the spread of infections
Minimizing the spread of infections is a challenging problem, and it is the subject matter in
many different fields such as epidemiology and cyber-security. In this paper, we investigate …
many different fields such as epidemiology and cyber-security. In this paper, we investigate …
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 …