Iterated k-opt local search for the maximum clique problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4446 LNCS, Issue , 2007, Pages 84-95

  Katayama, Kengo ^a   Sadamatsu, Masashi ^a   Narihisa, Hiroyuki ^a  

^a OKAYAMA UNIVERSITY OF SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; GRAPH THEORY; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

ITERATED LOCAL SEARCH; K-OPT LOCAL SEARCH (KLS); MAXIMUM CLIQUE PROBLEM;

COMBINATORIAL OPTIMIZATION;

EID: 38049011876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71615-0_8     Document Type: Conference Paper

References (23)

1. D. Applegate, W. Cook, and A. Rohe. Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing, Vol. 15, No. 1, pp. 82-92, 2003.
2. R. Battiti and M. Protasi. Reactive local search for the maximum clique problem. Algorithmic, Vol. 29, No. 4, pp. 610-637, 2001.
3. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P.M. Pardalos, editors, Handbook of Combinatorial Optimization (suppl. Vol. A), pp. 1-74. Kluwer, 1999.
4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
5. P. Hansen, N. Mladenović, and D. Urošević. Variable neighborhood search for the maximum clique. Discrete Applied Mathematics, Vol. 145, No. 1, pp. 117-125, 2004.
6. 1-ε. Acta Mathematica, Vol. 182, pp. 105-142, 1999.
7. D.S. Johnson and L.A. McGeoch. The traveling salesman problem: A case study. In E. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pp. 215-310. John Wiley & Sons, 1997.
8. D.S. Johnson and M.A. Trick. Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
9. K. Katayama, A. Hamamoto, and H. Narihisa. An effective local search for the maximum clique problem. Information Processing Letters, Vol. 95, No. 5, pp. 503-511, 2005.
10. K. Katayama and H. Narihisa. Iterated local search approach using genetic transformation to the traveling salesman problem. In Proc. of the Genetic and Evolutionary Computation Conference, pp. 321-328, 1999.
11. K. Katayama, M. Tani, and H. Narihisa. Solving large binary quadratic programming problems by effective genetic local search algorithm. In Proc. of the Genetic and Evolutionary Computation Conference, pp. 643-650, 2000.
12. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, Vol. 49, pp. 291-307, 1970.
13. S. Khot. Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, pp. 600-609, 2001.
14. S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, Vol. 21, pp. 498-516, 1973.
15. H.R. Lourenço, O.C. Martin, and T. Stützte. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, Vol. 57 of International Series in Operations Research & Management Science, pp. 321-353. Kluwer Academic Publishers, Norwell, MA, 2003.
16. E. Marchiori. Genetic, iterated and multistart local search for the maximum clique problem. In Applications of Evolutionary Computing, LNCS 2279, pp. 112-121. Springer-Verlag, 2002.
17. P. Merz and B. Freisleben. Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation, Vol. 8, No. 1, pp. 61-91, 2000.
18. P. Merz and K. Katayama. Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems, Vol. 78, No. 1-3, pp. 99-118, 2004.
19. P. Moscato and C. Cotta. A gentle introduction to memetic algorithms. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, Vol. 57 of International Series in Operations Research & Management Science, pp. 105-144. Kluwer Academic Publishers, Norwell, MA, 2003.
20. P.R.J. Östergård. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, Vol. 120, No. 1-3, pp. 197-207, 2002.
21. W. Pullan and H.H. Hoos. Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research, Vol. 25, pp. 159-185, 2006.
22. A. Singh and A. K. Gupta. A hybrid heuristic for the maximum clique problem. Journal of Heuristics, Vol. 12, No. 1-2, pp. 5-22, 2006.
23. E. Tomita and T. Seki. An efficient branch-and-bound algorithm for finding a maximum clique. In Discrete Mathematics and Theoretical Computer Science, LNCS 2731, pp. 278-289. Springer-Verlag, 2003.