A polyhedral approach to least cost influence maximization in social networks
From MaRDI portal
Publication:2111478
DOI10.1007/s10878-022-00971-xOpenAlexW4313595187MaRDI QIDQ2111478
Cheng-Lung Chen, Vladimir L. Boginski, Eduardo L. Pasiliao
Publication date: 16 January 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.01274
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Combinatorial model and bounds for target set selection
- New trends in influence maximization models
- The 0-1 knapsack problem with a single continuous variable
- Dynamic knapsack sets and capacitated lot-sizing
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Least cost influence propagation in (social) networks
- A two-stage stochastic programming approach for influence maximization in social networks
- Integer programming approach to static monopolies in graphs
- Facets of the dynamic monopoly polytope: linear ordering formulation
- A polyhedral study of dynamic monopolies
- Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study
- Least-Cost Influence Maximization on Social Networks
- On the Approximability of Influence in Social Networks
- On the acyclic subgraph polytope
- An exact algorithm for robust influence maximization
- Weighted target set selection on trees and cycles
- A branch‐and‐cut approach for the least cost influence problem on social networks
This page was built for publication: A polyhedral approach to least cost influence maximization in social networks
