Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
From MaRDI portal
Publication:5348807
Recommendations
- Identifying sets of key players in a social network
- An efficient linear programming based method for the influence maximization problem in social networks
- A global optimization algorithm for target set selection problems
- Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
- An optimal approach for the critical node problem using semidefinite programming
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- A new status index derived from sociometric analysis
- Emergence of Scaling in Random Networks
- Identifying sets of key players in a social network
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the Implementation of a Primal-Dual Interior Point Method
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Programming
- Semidefinite optimization
- Semidefinite programming in combinatorial optimization
- Simulation optimization: a review and exploration in the new era of cloud computing and big data
- The centrality of groups and classes
Cited in
(3)
This page was built for publication: Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348807)