期刊
MATHEMATICAL PROGRAMMING
卷 170, 期 1, 页码 293-325出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-018-1288-y
关键词
Influence maximization; Mixed-integer programming; Social network analysis
类别
资金
- WWTF [ICT15-014]
- MiUR, Italy (Project PRIN)
Influence maximization problems aim to identify key players in (social) networks and are typically motivated from viral marketing. In this work, we introduce and study the Generalized Least Cost Influence Problem (GLCIP) that generalizes many previously considered problem variants and allows to overcome some of their limitations. A formulation that is based on the concept of activation functions is proposed together with strengthening inequalities. Exact and heuristic solution methods are developed and compared for the new problem. Our computational results also show that our approaches outperform the state-of-the-art on relevant, special cases of the GLCIP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据