On Interdicting Dense Clusters in a Network

References

• Abello J, Pardalos PM, Resende MGC (1999) On maximum clique problems in very large graphs. Abello J, Vitter J, eds. External Memory Algorithms and Visualization, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50 (American Mathematical Society, Boston), 119–130.Google Scholar
• Burgio G, Arenas A, Gómez S, Matamalas JT (2021) Network clique cover approximation to analyze complex contagions through group interactions. Comm. Phys. 4(1):111.Crossref, Google Scholar
• Butenko S, Wilhelm WE (2006) Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1):1–17.Crossref, Google Scholar
• Caprara A, Carvalho M, Lodi A, Woeginger GJ (2014) A study on the computational complexity of the bilevel knapsack problem. SIAM J. Optim. 24(2):823–838.Crossref, Google Scholar
• Daemi N, Borrero JS, Balasundaram B (2022) Interdicting low-diameter cohesive subgroups in large-scale social networks. INFORMS J. Optim. 4(3):304–325.Google Scholar
• Erdös P, Rényi A (1959) On random graphs. Publicationes Mathematicae 6:290–297.Crossref, Google Scholar
• Furini F, Ljubić I, Martin S, San Segundo P (2019) The maximum clique interdiction problem. Eur. J. Oper. Res. 277(1):112–127.Crossref, Google Scholar
• Furini F, Ljubić I, San Segundo P, Zhao Y (2021) A branch-and-cut algorithm for the edge interdiction clique problem. Eur. J. Oper. Res. 294(1):54–69.Crossref, Google Scholar
• Hébert-Dufresne L, Mistry D, Althouse BM (2020) Spread of infectious disease and social awareness as parasitic contagions on clustered networks. Phys. Rev. Res. 2(3):033306.Crossref, Google Scholar
• Israeli E, Wood RK (2002) Shortest-path network interdiction. Networks 40(2):97–111.Crossref, Google Scholar
• Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math. Programming 32(2):146–164.Crossref, Google Scholar
• Krebs V (2002) Uncloaking terrorist networks. First Monday 7(4), http://journals.uic.edu/ojs/index.php/fm/article/view/941.Crossref, Google Scholar
• Lodi A, Ralphs TK, Woeginger GJ (2014) Bilevel programming and the separation problem. Math. Programming 146(1):437–458.Crossref, Google Scholar
• Mahdavi Pajouh F (2020) Minimum cost edge blocker clique problem. Ann. Oper. Res. 294(1):345–376.Crossref, Google Scholar
• Mahdavi Pajouh F, Boginski V, Pasiliao EL (2014a) Minimum vertex blocker clique problem. Networks 64(1):48–64.Crossref, Google Scholar
• Mahdavi Pajouh F, Miao Z, Balasundaram B (2014b) A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Res. 216(1):145–161.Crossref, Google Scholar
• Majhi S, Perc M, Ghosh D (2022) Dynamics on higher-order networks: A review. J. Roy. Soc. Interface 19(188):20220043.Crossref, Google Scholar
• Miao Z, Balasundaram B (2020) An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS J. Comput. 32(3):763–778.Link, Google Scholar
• Nasirian F, Mahdavi Pajouh F, Namayanja J (2019) Exact algorithms for the minimum cost vertex blocker clique problem. Comput. Oper. Res. 103:296–309.Crossref, Google Scholar
• Newman M (2018) Networks (Oxford University Press, Oxford, UK).Crossref, Google Scholar
• Pardalos PM, Xue J (1994) The maximum clique problem. J. Global Optim. 4(3):301–328.Crossref, Google Scholar
• Pattillo J, Youssef N, Butenko S (2013a) On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1):9–18.Crossref, Google Scholar
• Pattillo J, Veremyev A, Butenko S, Boginski V (2013b) On the maximum quasi-clique problem. Discrete Appl. Math. 161(1–2):244–257.Crossref, Google Scholar
• Rossi RA, Ahmed NK (2015) Network repository. An interactive scientific network data repository. Accessed October 4, 2024, https://networkrepository.com.Google Scholar
• Sageman M (2004) Understanding Terror Networks (University of Pennsylvania Press, Philadelphia).Crossref, Google Scholar
• Smith JC, Song Y (2020) A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3):797–811.Crossref, Google Scholar
• Song Y, Shen S (2016) Risk-averse shortest path interdiction. INFORMS J. Comput. 28(3):527–539.Link, Google Scholar
• Tahernejad S, Ralphs T, DeNegre S (2020) A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Programming Comput. 12:529–568.Crossref, Google Scholar
• Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comput. Optim. Appl. 56(1):113–130.Crossref, Google Scholar
• Veremyev A, Prokopyev OA, Butenko S, Pasiliao EL (2016) Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. 64(1):177–214.Crossref, Google Scholar
• Wei N, Walteros JL, Mahdavi Pajouh F (2021) Integer programming formulations for minimum spanning tree interdiction. INFORMS J. Comput. 33(4):1461–1480.Abstract, Google Scholar
• Woeginger GJ (2021) The trouble with the second quantifier. 4OR 19(2):157–181.Google Scholar
• Zhong H, Mahdavi Pajouh F, Butenko S, Prokopyev OA (2024) On interdicting dense clusters in a network. https://doi.org/10.1287/ijoc.2023.0027, https://github.com/INFORMSJoC/2023.0027.Google Scholar