Papers
Topics
Authors
Recent
Search
2000 character limit reached

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks

Published 22 Mar 2023 in math.OC and cs.DM | (2303.12402v3)

Abstract: The COVID-19 pandemic has been a recent example for the spread of a harmful contagion in large populations. Moreover, the spread of harmful contagions is not only restricted to an infectious disease, but is also relevant to computer viruses and malware in computer networks. Furthermore, the spread of fake news and propaganda in online social networks is also of major concern. In this study, we introduce the measure-based spread minimization problem (MBSMP), which can help policy makers in minimizing the spread of harmful contagions in large networks. We develop exact solution methods based on branch-and-Benders-cut algorithms that make use of the application of Benders decomposition method to two different mixed-integer programming formulations of the MBSMP: an arc-based formulation and a path-based formulation. We show that for both formulations the Benders optimality cuts can be generated using a combinatorial procedure rather than solving the dual subproblems using linear programming. Additional improvements such as using scenario-dependent extended seed sets, initial cuts, and a starting heuristic are also incorporated into our branch-and-Benders-cut algorithms. We investigate the contribution of various components of the solution algorithms to the performance on the basis of computational results obtained on a set of instances derived from existing ones in the literature.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Detecting critical nodes in sparse graphs. Computers & Operations Research 36, 2193–2200.
  2. A survey on influence maximization in a social network. Knowledge and Information Systems 62, 3417–3455.
  3. Emergence of scaling in random networks. Science 286, 509–512.
  4. An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections. Discrete Optimization 30, 144–167.
  5. The igraph software package for complex network research. InterJournal, complex systems 1695, 1–9.
  6. Link removal for the control of stochastically evolving epidemics over networks: A comparison of approaches. Journal of Theoretical Biology 371, 154–165.
  7. On random graphs. I. Publicationes Mathematicae Debrecen .
  8. Structure of social contact networks and their impact on epidemics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 70, 181.
  9. Least cost influence propagation in (social) networks. Mathematical Programming 170, 293–325.
  10. The maximum clique interdiction problem. European Journal of Operational Research 277, 112–127.
  11. A branch-and-cut algorithm for the edge interdiction clique problem. European Journal of Operational Research 294, 54–69.
  12. Critical arcs detection in influence networks. Networks 71, 412–431.
  13. Fortification against cascade propagation under uncertainty. INFORMS Journal on Computing 33, 1481–1499.
  14. On the optimal solution of budgeted influence maximization problem in social networks. Operational Research 19, 817–831.
  15. Large-scale influence maximization via maximal covering location. European Journal of Operational Research 289, 144–164.
  16. A branch-and-cut approach for the least cost influence problem on social networks. Networks 76, 84–105.
  17. Influence analysis: A survey of the state-of-the-art. Mathematical Foundations of Computing 1, 201.
  18. Efficient local strategies for vaccination and network attack. EPL (Europhysics Letters) 68, 908.
  19. Node deletion-based algorithm for blocking maximizing on negative influence from uncertain sources. Knowledge-Based Systems 231, 107451.
  20. Benders decomposition for competitive influence maximization in (social) networks. Omega 100, 102264.
  21. Maximizing the spread of influence through a social network, in: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146.
  22. Maximizing the spread of influence through a social network. Theory of Computing 11, 105–147.
  23. Blocking links to minimize contamination spread in a social network. ACM Transactions on Knowledge Discovery from Data (TKDD) 3, 1–23.
  24. Finding critical nodes for inhibiting diffusion of complex contagions in social networks, in: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer. pp. 111–127.
  25. Blocking simple and complex contagion by edge removal, in: 2013 IEEE 13th International Conference on Data Mining, IEEE. pp. 399–408.
  26. The critical node detection problem in networks: A survey. Computer Science Review 28, 92–117.
  27. The science of fake news. Science 359, 1094–1096.
  28. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering 30, 1852–1872.
  29. After-effects of the COVID-19 pandemic: Prospects for medium-term economic damage. IMF Working Papers 2021.
  30. Monte carlo sampling-based methods for stochastic optimization. Surveys in Operations Research and Management Science 19, 56 – 85.
  31. Methods for removing links in a network to minimize the spread of infections. Computers & Operations Research 69, 10–24.
  32. An exact algorithm for robust influence maximization. Mathematical Programming 183, 419–453.
  33. Exact algorithms for the minimum cost vertex blocker clique problem. Computers & Operations Research 103, 296–309.
  34. Minimum cost edge blocker clique problem. Annals of Operations Research 294, 345–376.
  35. A branch-and-cut approach for the weighted target set selection problem on social networks. INFORMS Journal on Optimization 1, 304–322.
  36. Exact interdiction models and algorithms for disconnecting networks via node deletions. Discrete Optimization 9, 172–188.
  37. A survey of models and algorithms for social influence analysis, in: Social network data analytics. Springer, pp. 177–214.
  38. Influence maximization in near-linear time: A martingale approach, in: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539–1554.
  39. Influence maximization with deactivation in social networks. European Journal of Operational Research 278, 105–119.
  40. Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. European Journal of Operational Research 297, 40–52.
  41. Negative influence minimizing by blocking nodes in social networks, in: Proceedings of the 17th AAAI Conference on Late-Breaking Developments in the Field of Artificial Intelligence, pp. 134–136.
  42. A two-stage stochastic programming approach for influence maximization in social networks. Computational Optimization and Applications 69, 563–595.
  43. On the economic impact of crypto-ransomware attacks: the state of the art on enterprise systems. European Journal for Security Research 4, 3–31.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.

Sign Up for Free