Iterated k-Opt Local Search for the Maximum Clique Problem.
Kengo KatayamaMasashi SadamatsuHiroyuki NarihisaPublished in: EvoCOP (2007)
Keyphrases
- search algorithm
- global search
- combinatorial optimization
- traveling salesman problem
- memetic algorithm
- tabu search
- benchmark instances
- branch and bound algorithm
- search space
- hybrid ga
- genetic algorithm
- optimal solution
- job shop scheduling problem
- hooke jeeves
- search engine
- multimodal function optimization
- domain independent planning
- neighborhood search
- hill climbing
- search procedure
- heuristic search
- initial solution
- search heuristics
- maximum clique
- convergence speed
- search strategies
- simulated annealing
- solving global optimization problems