An optimal approach for the critical node problem using semidefinite programming
type: Item
instance of: scholarly article
title: An optimal approach for the critical node problem using semidefinite programming
zbMATH Open document ID: 1400.90243
author: Cheng Jiang
author: Juyun Wang
author: Hua Yu
author: Zhong-Hua Liu
author: Xiao-ling Guo
published in: Physica A
publication date: 2018-11-13T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6978978
zbMATH Keywords: critical node problem
zbMATH Keywords: quadratically constrained quadratic programming
zbMATH Keywords: semidefinite programming
zbMATH Keywords: network optimization
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
full work available at URL: j.physa.2016.11.071
OpenAlex ID: W2565616647
cites work: How the science of complex networks can help developing strategies against terrorism
cites work: Epidemic dynamics on complex networks
cites work: Identifying sets of key players in a social network
cites work: Detecting critical nodes in sparse graphs
cites work: A derandomized approximation algorithm for the critical node detection problem
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q4382667
cites work: Q3267900
cites work: Collective dynamics of ‘small-world’ networks
cites work: SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
cites work: An efficient approach to solve the large-scale semidefinite programming problems
cites work: The university of Florida sparse matrix collection
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
DOI: 10.1016/J.PHYSA.2016.11.071
description: scientific article; zbMATH DE number 6978978