On the optimal solution of budgeted influence maximization problem in social networks

Barabasi A (2016) Network science. Cambridge University Press, Cambridge Brown D, Hayes N (2008) Influencer marketing: who really influences your customers? Butterworth-Heinemann Publication, Waltham Cao Y, Nsakanda A, Diaby M (2014) Planning the supply of rewards with cooperative promotion considerations in coalition loyalty programmes management. J Oper Res Soc. doi:10.1057/jors.2014.81 Chen W, Wang Y, Yang S (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of 16th ACM SIGKDD conference on knowledge discovery and data mining, pp 1029–1038 Han S, Zhuang F, He Q, Shi Z (2014) Balanced seed selection for budgeted influence maximization in social networks. In: 18th Pacific-Asia conference on advances in knowledge discovery and data mining, pp 65–77 Heidemann J, Klier M, Probst F (2012) Online social networks: A survey of a global phenomenon. Comput Netw 56:3866–3878 Hu J, Meng K, Chen X, Lin C, Huang J (2014) Analysis of influence maximization in large-scale social networks. ACM SIGMETRICS Perform Eval Rev 41(4):78–81. doi:10.1145/2627534.2627559 ILOG-CPLEX (2013) Cplex 12.6 user’s manual. ILOG Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of 9th ACM SIGKDD conference on knowledge discovery and data mining, pp 137–146 Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):5–39 Krause A, Guestrin C (2005) A note on the budgeted maximization on submodular functions. technical report cmu-cald-05-103. Technical report, Carnegie Mellon University Lee J, Hasenbein J, Morton D (2015) Optimization of stochastic virus detection in contact networks. Oper Res Lett 43:59–64 Leskovec J, Krause K, Guestrin C, Faloustos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of 13th ACM SIGKDD conference on knowledge discovery and data mining, pp 420–429 Linderoth J, Shapiro A, Wright S (2006) The empirical behavior of sampling methods for stochastic programming. Ann Oper Res 142(1):215–241. doi:10.1007/s10479-006-6169-8 Mak W, Morton D, Wood R (1999) Monte carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett 24:47–56 Mandala SR, Kumara SRT, Rao CR (2013) Clustering social networks using ant colony optimization. Oper Res Int J 13:47–65 Nemhauser G, Wolsey L, Fisher M (1978) An analysis of approximations for maximizing submodular set functions. Math Program 14:265–294 Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084–1094 Norkin V, Pflug G, Ruszczyski A (1998) A branch and bound method for stochastic global optimization. Math Program 83(1–3):425–450. doi:10.1007/BF02680569 Shapiro A (2008) Monte carlo sampling methods. In: Ruszczynski A, Shapiro A (eds) Stochastic programming. Handbooks in operations research and management science. vol 10, pp 353–426 Sheldon D, Dilkina B, Elmachtoub A, Finseth R, Sabharwal A, Conrad J, Shmoys D, Allen W, Amundsen O, Vaughan B (2010) Maximizing the spread of cascades using network design. In: Proceedings of the 26th conference on uncertainty in artificial intelligence, pp 517–526 Wang Y, Huang W, Wang LZT, Yang D (2013) Influence maximization with limit cost in social network. Sci China Inf Sci 56(7):1–14 Yan E, Ding Y (2009) Applying centrality measures to impact analysis: a coauthorship network analysis. J Am Assoc Inf Sci Technol 60(10):2107–2118. doi:10.1002/asi.v60:10