Minimum cost edge blocker clique problem

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Given a graph with weights on its vertices and blocking costs on its edges, and a user-defined threshold τ> 0 , the minimum cost edge blocker clique problem (EBCP) is introduced as the problem of blocking a minimum cost subset of edges so that each clique’s weight is bounded above by τ. Clusters composed of important actors with quick communications can be effectively modeled as large-weight cliques in real-world settings such as social, communication, and biological systems. Here, we prove that EBCP is NP-hard even when τ is a fixed parameter, and propose a combinatorial lower bound for its optimal objective. A class of inequalities that are valid for the set of feasible solution to EBCP is identified, and sufficient conditions for these inequalities to induce facets are presented. Using this class of inequalities, EBCP is formulated as a linear 0–1 program including potentially exponential number of constraints. We develop the first problem-specific branch-and-cut algorithm to solve EBCP, which utilizes the aforementioned constraints in a lazy manner. We also developed the first combinatorial branch-and-bound solution approach for this problem, which aims to handle large graph instances. Finally, computational results of solving EBCP on a collection of random graphs and power-law real-world networks by using our proposed exact algorithms are also provided.

Original languageEnglish
Pages (from-to)345-376
Number of pages32
JournalAnnals of Operations Research
Volume294
Issue number1-2
DOIs
StatePublished - Nov 2020

Keywords

  • Edge blocker
  • Exact algorithms
  • Maximum weighted clique
  • NP-hard
  • Network interdiction

Fingerprint

Dive into the research topics of 'Minimum cost edge blocker clique problem'. Together they form a unique fingerprint.

Cite this