A new branch-and-bound algorithm for the Maximum Weighted Clique Problem

Pablo San Segundo,Fabio Furini,Jorge Artieda

Computers & Operations Research（2019）

引用 19|浏览10

暂无评分

摘要

•A new incremental bound for the Maximum Weighted Clique Problem based on an independent set cover.•A Branch-and-Bound exact algorithm for the MaximumWeighted Clique Problem.•Extensive computational experiments.

查看译文

关键词

Maximum Weighted Clique Problem,Branch-and-Bound algorithm,Computational results

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要