Pages that link to "Item:Q1744898"
From MaRDI portal
The following pages link to A two-stage stochastic programming approach for influence maximization in social networks (Q1744898):
Displaying 24 items.
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- A new algorithm for positive influence maximization in signed networks (Q1999214) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- An exact cutting plane method for \(k\)-submodular function maximization (Q2067498) (← links)
- Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs (Q2086688) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
- Influence maximization with deactivation in social networks (Q2424770) (← links)
- A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
- Least-Cost Influence Maximization on Social Networks (Q3386763) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems (Q5038169) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms (Q6081599) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- An exact method for influence maximization based on deterministic linear threshold model (Q6100686) (← links)
- Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints (Q6110458) (← links)
- Efficient presolving methods for the influence maximization problem (Q6139380) (← links)
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem (Q6196896) (← links)