摘要 : Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze iterated local search algorithms for the maximum clique problem. The basic components of such algorithms are a fast neighbourhood search (no... 展开
作者 | Grosso A Locatelli M Pullan W |
---|---|
作者单位 | |
期刊名称 | 《Journal of heuristics》 |
总页数 | 26 |
语种/中图分类号 | 英语 / O29 |
关键词 | Maximum clique Randomness Plateau search Penalties Restart rules LOCAL SEARCH STABILITY NUMBER ALGORITHM GRAPH OPTIMIZATION POLYNOMIALS BOUNDS |
馆藏号 | N2008EPST0001446 |