کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5102910 | 1480102 | 2017 | 29 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An optimal approach for the critical node problem using semidefinite programming
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
فیزیک ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An optimal approach for the critical node problem using semidefinite programming An optimal approach for the critical node problem using semidefinite programming](/preview/png/5102910.png)
چکیده انگلیسی
Detecting critical nodes in complex networks (CNP) has great theoretical and practical significance in many disciplines. The existing formulations for CNP are mostly, as we know, based on the integer linear programming model. However, we observed that, these formulations only considered the sizes but neglected the cohesiveness properties of the connected components in the induced network. To solve the problem and improve the performance of CNP solutions, we construct a novel nonconvex quadratically constrained quadratic programming (QCQP) model and derive its approximation solutions via semidefinite programming (SDP) technique and heuristic algorithms. Various types of synthesized and real-world networks, in the context of different connectivity patterns, are used to validate and verify the effectiveness of the proposed model and algorithm. Experimental results show that our method improved the state of the art of the CNP.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physica A: Statistical Mechanics and its Applications - Volume 471, 1 April 2017, Pages 315-324
Journal: Physica A: Statistical Mechanics and its Applications - Volume 471, 1 April 2017, Pages 315-324
نویسندگان
Cheng Jiang, Zhonghua Liu, Juyun Wang, Hua Yu, Xiaoling Guo,