Influence maximization with deactivation in social networks

DOI10.1016/j.ejor.2019.04.010zbMath1431.91310arXiv1904.08628MaRDI QIDQ2424770

Kübra Tanınmış, Necati Aras, İ. Kuban Altınel

Publication date: 25 June 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.08628

zbMATH Keywords

stochastic optimization; metaheuristics; influence maximization; matheuristics; bilevel modeling

Mathematics Subject Classification ID

91D30: Social networks; opinion dynamics

90C10: Integer programming

90C15: Stochastic programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Influence maximization algorithm based on Gaussian propagation model, A new algorithm for positive influence maximization in signed networks, Incentive rate determination in viral marketing, Positive influence maximization in signed social networks under independent cascade model, Generating weighted social networks using multigraph, Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems

Uses Software

• igraph

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Bilevel programming: a survey
• A branch and bound method for stochastic global optimization
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Multilevel decision-making: a survey
• A two-stage stochastic programming approach for influence maximization in social networks
• The sample average approximation method applied to stochastic routing problems: a computational study
• Scalable influence maximization for independent cascade model in large-scale social networks
• A cutting-plane algorithm for solving a weighted influence interdiction problem
• From the Cover: The structure of scientific collaboration networks
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Maximizing Influence in Competitive Environments: A Game-Theoretic Approach
• Word of Mouth: Rumor Dissemination in Social Networks
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Collective dynamics of ‘small-world’ networks
• Mathematical Programs with Optimization Problems in the Constraints