A branch‐and‐cut approach for the least cost influence problem on social networks

DOI10.1002/net.21941OpenAlexW3016007659MaRDI QIDQ6092651

No author found.

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21941

zbMATH Keywords

integer programminginfluence maximizationexact methodstrong formulation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (3)

Influence Maximization with Latency Requirements on Social Networks ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ A polyhedral approach to least cost influence maximization in social networks

Cites Work

• Unnamed Item
• Least cost influence propagation in (social) networks
• A cutting-plane algorithm for solving a weighted influence interdiction problem
• Least-Cost Influence Maximization on Social Networks
• Optimizing Spread of Influence in Social Networks via Partial Incentives
• On the Approximability of Influence in Social Networks
• On the acyclic subgraph polytope
• Collective dynamics of ‘small-world’ networks

This page was built for publication: A branch‐and‐cut approach for the least cost influence problem on social networks