A hybrid heuristic for the maximum clique problem

Journal of Heuristics

Volumn 12, Issue 1-2, 2006, Pages 5-22

  Singh, Alok ^a   Gupta, Ashok Kumar ^a  

^a UNIVERSITY OF ALLAHABAD   (India)

Author keywords

Combinatorial optimization; Greedy heuristic; Maximum clique; Steady state genetic algorithm

Indexed keywords

BENCHMARKING; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; PROBLEM SOLVING;

CLIQUE PROBLEM; DIMACS BENCHMARK INSTANCES;

HEURISTIC METHODS;

EID: 32544433135     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10732-006-3750-x     Document Type: Article

References (25)

1. Abello, J., P.M. Pardalos, and M.G.C. Resende. (2000). "On Maximum Clique Problem in Very Large Graphs." DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50, 119-130.
2. Aggarwal, C.C., J.B. Orlin, and R.P. Tai. (1997). "An Optimized Crossover for Maximum Independent Set."Operations Research 45, 226-234.
3. Balas, E. and W. Niehaus. (1996). "Finding Large Cliques in Arbitrary Graphs by Bipartite Matching." DIMACS Series in Discivte Mathematics and Computer Science 26, 29-51.
4. Balas, E. and W. Niehaus. (1998). "Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problem." Journal of Heuristics 4, 107-122.
5. Battiti, R. and M. Protasi. (2001). "Reactive Local Search for the Maximum Clique Problem." Algorithmica 29 (4), 610-637.
6. Beasley, J.E. and P.C. Chu. (1996). "A Genetic Algorithm for the Set Covering Problem." Eumpean Journal of Operation Research 94 (2), 394-404.
7. Biggs, N. (1990). "Some Heuristics for Graph Coloring." R. Nelson and R. J. Wilson (eds.), In Graph Colourings pp. 87-96, NY: Longman.
8. Bomze, I.M., M. Budinich, P. M. Pardalos and M. Pelilo. (1999). "The Maximum Clique Problem." Handbook of Combinatorial Optimization, 4, Boston, MA: Kluwer Academic Publishers.
9. Busygin, S. (2002). "A New Trust Region Technique for the Maximum Weight Clique Problem." submitted to the special issue of Discrete and Applied Mathematics on Combinatorial Optimization.
10. Carraghan, R. and P.M. Pardalos. (1990). "An Exact Algorithm for the Maximum Clique Problem." Operation. Research Letters 9, 375-382.
11. Davis, L. (1991). Handbook of Genetic Algorithms, New York: Van Nostrand Reinhold.
12. Dorigo, M. and T. Stutzte. (2004). Ant Colony Optimization. MIT Press/Bradford Books.
13. Fenet, S. and C. Solnon, (2003). "Searching for Maximum Clique with Ant Colony Optimization." Applications of Evolutionary Computing (EvoCOP 2003), LNCS 2611, Springer-Verlag, pp. 236-246.
14. Feo, T.A., M.G.C. Resende, and S.M. Smith. (1994). "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set." Operations Research 46(5), 860-878.
15. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W. H. Freeman.
16. Grosso, A., M. Locatelli, and F. Della Croce. (2004). "Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem." Journal of Heuristics 10, 135-152.
17. Homer, S. and M. Peinado. (1996). "On the Performance of Polynomial Time Clique Approximation Algorithms on Very Large Graphs" Clique, Coloring and Satisfiability, Second DIMACS Implementation Challenge, pp. 221-242 D. S. Johnson and M. A. Trick (eds.).
18. Jagota, A. and L.A. Sanchis. (2001). "Adaptive, Restait, Randomized Greedy Heuristics for Maximum Clique. "Journal of Heuristics 7, 565-585.
19. Johnson, D.S. (1974). "Approximation Algorithms for Combinatorial Problems." Journal of Computer Science 9, 256-278.
20. Khot, S. (2001). "Improved Inapproximability Results for Maxclique, Chromatic Number and Approximate Graph Coloring." In Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 600-609.
21. Marchiori, E. (2002). "Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem." Applications of Evolutionary Computing (EvoCOP 2002), LNCS 2279, Springer-Verlag, pp. 112-121.
22. Massaro, A., M. Pellilo and I. M. Bomze. (2002). "A Complementary Pivoting Approach to the Maximum Weight Clique Problem." SIAM Journal of Optimization 12, 928-948.
23. Motzkin, T.S. and E.G. Strauss. (1965). "Maxima for Graphs and a New Proof of Theorem of Turan." Canadian Journal of Mathematics 17, 533-540.
24. Resende, M.G.C., T.A. Feo, and S.H. Smith. (1998). "Algorithm 786: FORTRAN Subroutines for Approximate Solution of the Maximum Independent Set Problem Using GRASP." ACM Transactions on Mathematical Software 24, 386-394.
25. Soriano, P. and M. Gendreau. (1996). "Tabu Search Algorithms for the Maximum Clique." Clique, Coloring and Satisfiability, Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (eds.), pp. 221-242.