arrow
返回

Minimum cost edge blocker clique problem

delete2019-07-20
delete7
PRE
AI
F
Foad Mahdavi Pajouh *
DOI:10.1007/s10479-019-03315-xdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Given a graph with weights on its vertices and blocking costs on its edges, and a user-defined threshold tau 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 tau 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 tau 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.
Keyword:
Edge blocker
Maximum weighted clique
NP-hard
Exact algorithms
Network interdiction
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Annals of Operations Research 封面图
Annals of Operations Research
IF:
4.5
论文数:
8.1K
被引数:
2.1W

机构

U
university of massachusetts system
学者数:
3.9W
论文数: 3.6W
被引数: 42
引用论文

引用论文

err分享
err收藏
Cryptosporidium sp. in cultivated oysters and the natural oyster stock of the state of Maranhão, Brazil
err2023-01-01
err0
errOAAI
errCamila Moraes Silva; Anna Letícia Pinto Silva; Karinne Francisca Cardoso Watanabe; Raimunda Deusilene Barreira Porto; Danilo Cutrim Bezerra; Larissa Sarmento dos Santos Ribeiro; Viviane Correa Silva Coimbra; Hamilton Pereira Santos; Nancyleni Pinto Chaves Bezerra
err分享
err收藏
Detecting critical nodes in sparse graphs
err2009-07-01
err292
PREAI
errArulselvan, Ashwin; Commander, Clayton W.; Elefteriadou, Lily; Pardalos, Panos M.
err分享
err收藏
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
err2012-04-01
err114
errOAAI
errDinh, Thang N.; Xuan, Ying; Thai, My T.; Pardalos, Panos M.; Znati, Taieb
err分享
err收藏
Finding k most influential edges on flow graphs
err2017-04-01
err13
PREAI
errWong, Petrie; Sun, Cliz; Lo, Eric; Yiu, Man Lung; Wu, Xiaowei; Zhao, Zhichao; Chan, T. -H. Hubert; Kao, Ben
err分享
err收藏
First Report of Zoonotic Genotype of Giardia duodenalis in Mussels (Mytilus edulis) from Patagonia Argentina来自阿根廷巴塔哥尼亚的贻贝 (Mytilus edulis) 中 十二指肠贾第鞭毛虫 的人畜共患病基因型的第一份报告
err2021-02-01
err0
errOAAI
errClaudia Torrecillas; María Angélica Fajardo; María Alejandra Córdoba; Marco Sánchez; Ivana Mellado; Betiana Garrido; Isabel Aleixandre-Górriz; Paula Sánchez-Thevenet; David Carmena
err分享
err收藏
Complexity of the critical node problem over trees
err2011-12-01
err64
errOAAI
errDi Summa, Marco; Grosso, Andrea; Locatelli, Marco
err分享
err收藏
学者 查看更多内容