Solving the maximum clique problem by k-opt local search

Proceedings of the ACM Symposium on Applied Computing

Volumn 2, Issue , 2004, Pages 1021-1025

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

^a OKAYAMA UNIVERSITY OF SCIENCE   (Japan)

Author keywords

Combinatorial Optimization; Local Search; Maximum Clique Problem; Neighborhood; Variable Depth Search

Indexed keywords

COMPUTATION THEORY; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; PROGRAM INTERPRETERS;

COMBINATORIAL OPTIMIZATION; LOCAL SEARCH; MAXIMUM CLIQUE PROBLEM; NEIGHBOURHOOD; VARIABLE DEPTH SEARCH;

COMBINATORIAL MATHEMATICS;

EID: 2442615182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968107     Document Type: Conference Paper

References (16)

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," Algorithmica, vol. 29, no. 4, pp. 610-637, 2001.
3. DIMACS URL: http://dimacs.rutgers.edu/Challenges/.
4. M.R. Garey and D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
5. 1-ε," Acta Mathematica, vol. 182, pp. 105-142, 1999.
6. D.S. Johnson and L.A. McGeoch, "The traveling salesman problem: A case study," Local Search in Combinatorial Optimization, John Wiley & Sons, pp. 215-310, 1997.
7. D.S. Johnson, "Local optimization and the traveling salesman problem," Proc. 17th. International Colloquium on Automata, Languages and Programming, pp. 446-461, 1990.
8. K. Katayama, M. Tani, and H. Narihisa, "Solving large binary quadratic programming problems by effective genetic local search algorithm," Proc. of the 2000 Genetic and Evolutionary Computation Conference, pp. 643-650, 2000.
9. K. Katayama and H. Narihisa, "Iterated local search approach using genetic transformation to the traveling salesman problem," Proc. of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 321-328, 1999.
10. B.W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell System Technical Journal, vol. 49, pp. 291-307, 1970.
11. S. Lin and B.W. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Operations Research, vol. 21, pp. 498-516, 1973.
12. E. Marchiori, "Genetic, iterated and multistart local search for the maximum clique problem," Applications of Evolutionary Computing, Springer, LNCS 2279, pp. 112-121, 2002.
13. E. Marchiori, "A simple heuristic based genetic algorithm for the maximum clique problem," Proc. of ACM Symposium on Applied Computing (SAC-98), pp. 366-373, 1998.
14. P. Merz and B. Freisleben, "Memetic algorithms for the traveling salesman problem," Complex Systems, vol. 13, no. 4, pp. 297-345, 2001.
15. P. Merz and B. Freisleben, "Greedy and local search heuristics for unconstrained binary quadratic programming," Journal of Heuristics, vol. 8, no. 2, pp. 197-213, 2002.
16. M. Yagiura, T. Yamaguchi and T. Ibaraki, "A variable depth search algorithm for the generalized assignment problem," Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, (S. Voss, S. Martello, I.H. Osman and C. Roucairol, eds.), Kluwer Academic Publishers, pp. 459-471, 1999.