An optimal approach for the critical node problem using semidefinite programming

DOI10.1016/J.PHYSA.2016.11.071zbMath1400.90243OpenAlexW2565616647MaRDI QIDQ1620469

Hua Yu, Juyun Wang, Cheng Jiang, Xiao-ling Guo, Zhong-Hua Liu

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2016.11.071

zbMATH Keywords

quadratically constrained quadratic programmingsemidefinite programmingnetwork optimizationcritical node problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Convex programming (90C25) Quadratic programming (90C20) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Critical node detection problem for complex network in undirected weighted networks

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• A derandomized approximation algorithm for the critical node detection problem
• Detecting critical nodes in sparse graphs
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• How the science of complex networks can help developing strategies against terrorism
• An efficient approach to solve the large-scale semidefinite programming problems
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Epidemic dynamics on complex networks
• The university of Florida sparse matrix collection
• Graph Implementations for Nonsmooth Convex Programs
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Collective dynamics of ‘small-world’ networks
• SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

This page was built for publication: An optimal approach for the critical node problem using semidefinite programming