Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
DOI10.1016/J.COR.2021.105441OpenAlexW3177299425MaRDI QIDQ2669540FDOQ2669540
Authors: Santiago Valdés Ravelo, Cláudio N. Meneses 
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105441
Recommendations
- A global optimization algorithm for target set selection problems
- A fast and effective heuristic for discovering small target sets in social networks
- On approximating target set selection
- Discovering small target sets in social networks: a fast and effective algorithm
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
dynamic programminginteger linear programmingtarget set selectionsubgradient methodLagrangian relaxationheuristic solution
Cites Work
- Some results on the target set selection problem
- On the approximability of influence in social networks
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Combinatorial model and bounds for target set selection
- Title not available (Why is that?)
- Treewidth governs the complexity of target set selection
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Irreversible conversion of graphs
- Surrogate gradient algorithm for Lagrangian relaxation
- How to choose friends strategically
- Discovering small target sets in social networks: a fast and effective algorithm
- Spread of influence in weighted networks under time and budget constraints
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
- Lagrangian relaxation for SVM feature selection
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Influence maximization with deactivation in social networks
- The hub location problem with market selection
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
Cited In (1)
Uses Software
This page was built for publication: Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669540)
