An effective local search for the maximum clique problem

Information Processing Letters

Volumn 95, Issue 5, 2005, Pages 503-511

  Katayama, Kengo ^a   Hamamoto, Akihiro ^a   Narihisa, Hiroyuki ^a  

^a OKAYAMA UNIVERSITY OF SCIENCE   (Japan)

Author keywords

Combinatorial optimization; Graph algorithms; Maximum clique problem; Neighborhood; Variable depth search

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; INFORMATION ANALYSIS; ITERATIVE METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; GRAPH ALGORITHM; MAXIMUM CLIQUE PROBLEM; NEIGHBORHOOD; VARIABLE DEPTH SEARCH;

ALGORITHMS;

EID: 22344440317     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.05.010     Document Type: Article

References (31)

1. J. Abello, P.M. Pardalos, and M.G.C. Resende On maximum clique problems in very large graphs J. Abello J. Vitter External Memory Algorithms and Visualization DIMACS Series on Discrete Mathematics and Theoretical Computer Science vol. 50 1999 Amer. Math. Soc. Providence, RI 119 130
2. D. Applegate, W. Cook, and A. Rohe Chained Lin-Kernighan for large traveling salesman problems INFORMS J. Comput. 15 1 2003 82 92
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems, in: Proc. 33rd Annual Symp. on Foundations of Computer Science, 1992, pp. 14-23
4. R. Battiti, and M. Protasi Reactive local search for the maximum clique problem Algorithmica 29 4 2001 610 637
5. I.M. Bomze, M. Budinich, M. Pelillo, and C. Rossi Annealed replication: a new heuristic for the maximum clique problem Discrete Appl. Math. 121 2002 27 49
6. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo The maximum clique problem D.Z. Du P.M. Pardalos Handbook of Combinatorial Optimization (suppl. vol. A) 1999 Kluwer Dordrecht 1 74
7. S. Burer, R.D.C. Monteiro, and Y. Zhang Maximum stable set formulations and heuristics based on continuous optimization Math. Programming 94 2002 137 166
8. L. Cavique, C. Rego, and I. Themido A scatter search algorithm for the maximum clique problem Essays and Surveys in Metaheuristics 2001 Kluwer Dordrecht 227 244
9. A.E. Eiben, and M. Schoenauer Evolutionary computing Inform. Process. Lett. 82 1 2002 1 6
10. U. Feige, S. Goldwasser, L. Lovász, S. Safra, M. Szegedy, Approximating clique is almost NP-complete, in: Proc. 32nd Annual Symp. on Foundations of Computer Science, San Juan, Puerto Rico, 1991, pp. 2-12
11. S. Fenet, and C. Solnon Searching for maximum cliques with ant colony optimization Applications of Evolutionary Computing Lecture Notes in Comput. Sci. vol. 2611 2003 Springer Berlin 236 245
12. T.A. Feo, M.G.C. Resende, and S.H. Smith A greedy randomized adaptive search procedure for maximum independent set Oper. Res. 42 1994 860 878
13. N. Funabiki, Y. Takefuji, and K.C. Lee A neural network model for finding a near-maximum clique Parallel Distrib. Comput. 14 3 1992 340 344
14. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
15. F. Glover, and M. Laguna Tabu Search 1998 Kluwer Dordrecht
16. J. Håstad Clique is hard to approximate within n 1 - ε Acta Math. 182 1999 105 142
17. D.S. Johnson M.A. Trick Cliques, Coloring, and Satisfiability, Second DIMACS Implementation Challenge DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 1996 Amer. Math. Soc. Providence, RI
18. D.S. Johnson, Local optimization and the traveling salesman problem, in: Proc. 17th Internat. Colloquium on Automata, Languages and Programming, 1990, pp. 446-461
19. K. Katayama, M. Tani, H. Narihisa, Solving large binary quadratic programming problems by effective genetic local search algorithm, in: Proc. Genetic and Evolutionary Computation Conf., 2000, pp. 643-650
20. K. Katayama, H. Narihisa, Iterated local search approach using genetic transformation to the traveling salesman problem, in: Proc. Genetic and Evolutionary Computation Conf., 1999, pp. 321-328
21. B.W. Kernighan, and S. Lin An efficient heuristic procedure for partitioning graphs Bell System Techn. J. 49 1970 291 307
22. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Oper. Res. 21 1973 498 516
23. E. Marchiori Genetic, iterated and multistart local search for the maximum clique problem Applications of Evolutionary Computing Lecture Notes in Comput. Sci. vol. 2279 2002 Springer Berlin 112 121
24. P. Merz, and K. Katayama Memetic algorithms for the unconstrained binary quadratic programming problem Biosystems 78 1-3 2004 99 118
25. P. Merz, and B. Freisleben Greedy and local search heuristics for unconstrained binary quadratic programming J. Heuristics 8 2 2002 197 213
26. P. Merz, and B. Freisleben Memetic algorithms for the traveling salesman problem Complex Systems 13 4 2001 297 345
27. P. Merz, and B. Freisleben Fitness landscapes, memetic algorithms and greedy operators for graph bipartitioning Evolutionary Comput. 8 1 2000 61 91
28. P.R.J. Östergård A fast algorithm for the maximum clique problem Discrete Appl. Math. 120 2002 195 205
29. S. Prestwich Combining the scalability of local search with the pruning techniques of systematic search Ann. Oper. Res. 115 2002 51 72
30. E. Tomita, and T. Seki An efficient branch-and-bound algorithm for finding a maximum clique Proc. 4th Internat. Conf. on Discrete Mathematics and Theoretical Computer Science Lecture Notes in Comput. Sci. vol. 2731 2003 Springer Berlin 278 289
31. M. Yagiura, T. Yamaguchi, and T. Ibaraki A variable depth search algorithm for the generalized assignment problem S. Voss S. Martello I.H. Osman C. Roucairol Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization 1999 Kluwer Dordrecht 459 471