Abstract
The objective of the Maximum Clique Problem (MCP) is to find the largest complete subgraph in a given graph. The problem is known as NP-hard and we have developed a heuristic algorithm based on a Scatter Search (SS) framework to find a lower bound for this maximization problem. The proposed algorithm was developed with two search features: a guidance search and a local search feature. For the first feature a Scatter Search algorithm was chosen with the purpose of extensively exploring regions with strategically combined solutions. The new solutions obtained in the combination phase are thereafter improved by a neighborhood search procedure based on tabu search for implementing the second feature. The computational results obtained with DIMACS clique benchmark instances show that the proposed algorithm finds solutions comparable to the ones provided by some of the most competitive algorithms for the MCP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
R. Battiti and M. Protasi. Reactive Local Search for the Maximum Clique Problem. Algorithmica,29:610–637, 2001.
C. Berge. Theory of Graphs and its Applications. Methuen, 1962.
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.
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.
N. Christofides. Graph Theory: An Algorithmic Approach. Academic Press, 1975.
V.-D. Cung, T. Mautor, P. Michelon, and A. Tavares. A Scatter Search Based Approach for the Quadratic Assignment Problem. In: Proceedings of IEEE International Conference on Evolutionary Computation, pages 165–169, 1997.
T.A. Feo, M.G. Resende, and S.H. Smith. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, 42:860–878, 1994.
C. Pried, A. Hertz, and D. de Werra. Stabulus: A Technique for Finding Stable Sets in Large Graphs with Tabu Search. Computing, 42:35–44,1989.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, 1979.
M. Gendreau, P. Soriano, and L. Salvail. Solving the Maximum Clique Problem using a Tabu Search Approach. Annals of Operations Research, 41:385–403, 1993.
F. Glover. Heuristics for Integer Programming using Surrogate Constraints. Decision Science, 8:156–166, 1977.
F. Glover. Tabu Search — Part I. ORSA Journal of Computing, 1:190–206, 1989.
F. Glover. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories. ORSA Journal on Computing, 7:426–442, 1995.
F. Glover. A Template for Scatter Search and Path Relinking. Lecture Notes in Computer Science, 1363:13–54, 1998.
F. Glover. Scatter Search and Path Relinking. In: New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, editors, pages 297–316, McGraw Hill, 1999.
F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
A. Jagota. Efficient Approximating Max-Clique in a Holpfield-Style Network. In: IEEE, International Joint Conference on Neural Networks, vol. 2, pages 248–253, Baltimore, 1992.
A. Jagota, L. Sanchis, and R. Ganesan. Approximately Solving Maximum Clique using Neural Network Related Heuristics. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26:169–203, 1996.
D.S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Science, 9:256–278, 1974.
D.S. Johnson and M.A. Trick (editors). Clique, Coloring and Satisfiability. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26, 1996.
M. Laguna. Scatter Search. Research Report, University of Colorado, Boulder, 1999.
H. Lourengo, J. Paixão, and R. Portugal. Meta-Heuristics for the BusDriver Scheduling Problem. Economic Working Papers Series 304, Universitat Pompeu Fabra, Barcelone, 1999.
C. Rego and P. Leão. A Scatter Search Tutorial for Graph-Based Permutation Problems. Research Paper HCES-10–00, Hearin Center for Enterprise Science, University of Mississippi, 2000.
B. Roy. Algèbre moderne et théorie des graphes. Tome 2, Dunod, 1970.
P. Soriano and M. Gendreau. Tabu Search Algorithms for the Maximum Clique. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26:221–242, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cavique, L., Rego, C., Themido, I. (2002). A Scatter Search Algorithm for the Maximum Clique Problem. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive