arrow
返回

EIA-CNDP: An exact iterative algorithm for critical node detection problem

delete2021-03-01
delete5
PRE
AI
J
Javad Rezaei
F
Fatemeh Zare‐Mirakabad *
S
S.​A. MirHassani
S
Sayed‐Amir Marashi
DOI:10.1016/j.cor.2020.105138delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In designing reliable and impermeable networks, the robustness of the network is evaluated against the removal and failure of the node or edge where the network robustness (network connectivity) is measured using various metrics (objective functions) such as the number of connected components, size of the largest connected component, and pairwise connectivity. Critical node detection problem (CNDP) is one of the main issues in this literature, which aims to find a set of vertices whose removal maximizes or minimizes some objective function. In this paper, the focus is on solving CNDP, considering the size of the largest connected component as its objective function. In this regard, we introduce a new problem called K-Group-Division-Problem and present a mixed integer linear programming model to solve it. We prove that under certain circumstances, any optimal solution of the new problem is also an optimal solution of CNDP. Analyzing the performance of the proposed model on solving CNDP, indicates that this model is highly competitive against the base model in the literature. Furthermore, a novel exact algorithm is introduced which improves the proposed mixed integer linear programming model to address CNDP more efficiently. The results show that the proposed algorithm is much more efficient, and, compared with the base model, it can solve the problem on networks with a higher number of nodes. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Exact algorithm
Critical node
Largest connected component
Mixed integer linear programming
Network vulnerability
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

U
University of Tehran
学者数:
2.4W
论文数: 2.3W
被引数: 2.7W
A
Amirkabir University of Technology
学者数:
1.1W
论文数: 1.1W
被引数: 1.0W
引用论文

引用论文

err分享
err收藏
Detecting critical nodes in sparse graphs
err2009-07-01
err292
PREAI
errArulselvan, Ashwin; Commander, Clayton W.; Elefteriadou, Lily; Pardalos, Panos M.
err分享
err收藏
Variable neighbourhood search: methods and applications变邻域搜索: 方法与应用
err2009-10-28
err643
PREAI
errHansen, Pierre; Mladenovic, Nenad; Moreno Perez, Jose A.
err分享
err收藏
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
err2012-04-01
err114
errOAAI
errDinh, Thang N.; Xuan, Ying; Thai, My T.; Pardalos, Panos M.; Znati, Taieb
err分享
err收藏
First Report of Zoonotic Genotype of Giardia duodenalis in Mussels (Mytilus edulis) from Patagonia Argentina来自阿根廷巴塔哥尼亚的贻贝 (Mytilus edulis) 中 十二指肠贾第鞭毛虫 的人畜共患病基因型的第一份报告
err2021-02-01
err0
errOAAI
errClaudia Torrecillas; María Angélica Fajardo; María Alejandra Córdoba; Marco Sánchez; Ivana Mellado; Betiana Garrido; Isabel Aleixandre-Górriz; Paula Sánchez-Thevenet; David Carmena
err分享
err收藏
学者 查看更多内容