Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
From MaRDI portal
Publication:6568498
DOI10.1016/j.cor.2024.106675MaRDI QIDQ6568498
Necati Aras, Markus Sinnl, Evren Güney, Kübra Tanınmış
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches
- Methods for removing links in a network to minimize the spread of infections
- Minimum cost edge blocker clique problem
- Detecting critical nodes in sparse graphs
- Exact algorithms for the minimum cost vertex blocker clique problem
- Least cost influence propagation in (social) networks
- The maximum clique interdiction problem
- A two-stage stochastic programming approach for influence maximization in social networks
- The critical node detection problem in networks: a survey
- An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Large-scale influence maximization via maximal covering location
- A branch-and-cut algorithm for the edge interdiction clique problem
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- Influence maximization with deactivation in social networks
- Influence analysis: A survey of the state-of-the-art
- Emergence of Scaling in Random Networks
- Critical arcs detection in influence networks
- Fortification Against Cascade Propagation Under Uncertainty
- An exact algorithm for robust influence maximization
- A branch‐and‐cut approach for the least cost influence problem on social networks
This page was built for publication: Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
