• Graduate Program
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Tinbergen Institute Lectures
    • Summer School
      • Deep Learning
      • Economics of Blockchain and Digital Currencies
      • Foundations of Machine Learning with Applications in Python
      • Marketing Research with Purpose
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Tinbergen Institute Summer School Program
    • Annual Tinbergen Institute Conference archive
  • News
  • Summer School
    • Deep Learning
    • Economics of Blockchain and Digital Currencies
    • Foundations of Machine Learning with Applications in Python
    • Marketing Research with Purpose
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
  • Alumni

Güney, E., Leitner, M., Ruthmair, M. and Sinnl, M. (2021). Large-scale influence maximization via maximal covering location European Journal of Operational Research, 289(1):144--164.


  • Journal
    European Journal of Operational Research

Influence maximization aims at identifying a limited set of key individuals in a (social) network which spreads information based on some propagation model and maximizes the number of individuals reached. We show that influence maximization based on the probabilistic independent cascade model can be modeled as a stochastic maximal covering location problem. A reformulation based on Benders decomposition is proposed and a relation between obtained Benders optimality cuts and submodular cuts for correspondingly defined subsets is established. We introduce preprocessing tests, which allow us to remove variables from the model and develop efficient algorithms for the separation of Benders cuts. Both aspects are shown to be crucial ingredients of the developed branch-and-cut algorithm since real-life social network instances may be very large. In a computational study, the considered variants of this branch-and-cut algorithm outperform the state-of-the-art approach for influence maximization by orders of magnitude.