A Variable Neighborhood Search heuristic for the maximum ratio clique problem.

Dominik Goeke,Mahdi Moeini,David Poganiuch

Computers & Operations Research（2017）

引用 4|浏览8

暂无评分

摘要

•We introduce a MS-VNS metaheuristic for solving the maximum ratio clique problem.•The metaheuristic is tested on standard test instances.•We compare our results with solutions from classic methods.•MS-VNS achieves high quality solutions in very short runtimes.

查看译文

关键词

Variable Neighborhood Search,Heuristic,Metaheuristic,Maximum ratio clique problem,Maximal clique

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要