A branch-and-cut algorithm for the Edge Interdiction Clique Problem

Fabio Furini,Ivana Ljubić,Pablo San Segundo,Yanlu Zhao

European Journal of Operational Research（2021）

引用 19|浏览9

暂无评分

摘要

•We design an exact algorithm for the Edge Interdiction Clique Problem (EICP).•The EICP aims at reducing the clique number by removing a subset of the edges.•We manage to solve the EICP in several sets of instances from the literature.•Extensive tests show that the algorithm outperforms the state-of-the-art approaches.

查看译文

关键词

Combinatorial optimization,Interdiction problems,Maximum clique,Most vital edges

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要