A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Pablo San Segundo,Stefano Coniglio,Fabio Furini,Ivana Ljubić

European Journal of Operational Research（2019）

引用 26|浏览40

暂无评分

摘要

•A new upper bound for the maximum edge-weighted clique problem is proposed.•A new exact maximum edge-weighTed clique algorithm is proposed.•In-depth empirical evaluation of the new algorithm and claims made are presented.

查看译文

关键词

Combinatorial optimization,Branch-and-bound,Maximum edge-weighted clique problem

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要