A two-stage stochastic programming approach for influence maximization in social networks
From MaRDI portal
Publication:1744898
DOI10.1007/s10589-017-9958-xzbMath1400.90238arXiv1512.04180OpenAlexW3124980765MaRDI QIDQ1744898
Hao-Hsiang Wu, Simge Küçükyavuz
Publication date: 20 April 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.04180
stochastic programmingsubmodularitysocial networksinfluence maximizationlinear thresholdindependent cascade
Related Items
Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems ⋮ Least cost influence propagation in (social) networks ⋮ A polyhedral approach to bisubmodular function minimization ⋮ Influence Maximization with Latency Requirements on Social Networks ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions ⋮ On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms ⋮ Weighted target set selection on trees and cycles ⋮ An exact method for influence maximization based on deterministic linear threshold model ⋮ Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints ⋮ Influence maximization with deactivation in social networks ⋮ Efficient presolving methods for the influence maximization problem ⋮ Math‐based reinforcement learning for the adaptive budgeted influence maximization problem ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ A new algorithm for positive influence maximization in signed networks ⋮ Large-scale influence maximization via maximal covering location ⋮ An exact algorithm for robust influence maximization ⋮ Least-Cost Influence Maximization on Social Networks ⋮ An exact cutting plane method for \(k\)-submodular function maximization ⋮ Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems ⋮ Sequence independent lifting for a set of submodular maximization problems ⋮ A polyhedral approach to least cost influence maximization in social networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Practical enhancements to the Magnanti-Wong method
- Detecting critical nodes in sparse graphs
- Partitioning procedures for solving mixed-variables programming problems
- Investments in stochastic maximum flow networks
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- A note on maximizing a submodular set function subject to a knapsack constraint
- The budgeted maximum coverage problem
- Scalable influence maximization for independent cascade model in large-scale social networks
- On generating maximal nondominated Benders cuts
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- A stochastic programming approach for supply chain network design under uncertainty
- Competitive Targeted Advertising Over Networks
- Hub Location as the Minimization of a Supermodular Set Function
- Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Submodularity of Influence in Social Networks: From Local to Global
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Lectures on Stochastic Programming
- Investing in arcs in a network to maximize the expected max flow
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Introduction to Stochastic Programming
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- Maximizing Social Influence in Nearly Optimal Time
- Machine Learning: ECML 2004
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
