Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems

DOI10.1016/J.COR.2021.105441MaRDI QIDQ2669540zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dynamic programmingheuristic solutioninteger linear programmingLagrangian relaxationsubgradient methodtarget set selection

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

Cites work

• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem
• Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
• Combinatorial model and bounds for target set selection
• Discovering small target sets in social networks: a fast and effective algorithm
• How to choose friends strategically
• scientific article; zbMATH DE number 1349588 (Why is no real title available?)
• Influence maximization with deactivation in social networks
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Irreversible conversion of graphs
• Lagrangian relaxation for SVM feature selection
• On the approximability of influence in social networks
• Solving target set selection with bounded thresholds faster than \(2^n\)
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
• Some results on the target set selection problem
• Spread of influence in weighted networks under time and budget constraints
• Surrogate gradient algorithm for Lagrangian relaxation
• The hub location problem with market selection
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Treewidth governs the complexity of target set selection

Cited in

(1)

• A global optimization algorithm for target set selection problems

Describes a project that uses

Uses Software

• Gurobi

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)