A Scatter Search Algorithm for the Maximum Clique Problem-Reference-Cited by-同舟云学术

A Scatter Search Algorithm for the Maximum Clique Problem

Published:2002 Issue: Volume: Page:227-244
ISSN:1387-666X
Container-title:Operations Research/Computer Science Interfaces Series
language:
Short-container-title:

Author:

Cavique Luís,Rego César,Themido Isabel

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4615-1507-4_11.pdf

Reference26 articles.

1. E. Balas and W. Niehaus. Optimized Crossover-Based Genetic Algorithms will be the Maximum Cardinality and Maximum Weight Clique Problems. Journal of Heuristics, 4:107–122, 1998.

2. R. Battiti and M. Protasi. Reactive Local Search for the Maximum Clique Problem. Algorithmica,29:610–637, 2001.

3. C. Berge. Theory of Graphs and its Applications. Methuen, 1962.

4. M. Brockington and J.C. Culberson. Camouflaging Independent Sets in Quasi-Random Graphs. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26:75–89, 1996.

5. L. Cavique, C. Rego, and I. Themido. Estruturas de Vizinhanga e Algoritmos de Procura Local para o Problema da Clique Máxima. To appear in: Revista de Investigação Operacional.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges;Mathematical Problems in Engineering;2021-05-31

2. A data reduction approach using hypergraphs to visualize communities and brokers in social networks;Social Network Analysis and Mining;2018-09-26

3. An Algorithm to Condense Social Networks and Identify Brokers;Advances in Artificial Intelligence -- IBERAMIA 2014;2014

4. A heuristic for the stability number of a graph based on convex quadratic programming and tabu search;Journal of Mathematical Sciences;2009-09

5. An Algorithm to Discover the k-Clique Cover in Networks;Progress in Artificial Intelligence;2009