The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem.
Kazuho KanaharaShun ItoKengo KatayamaPublished in: ICCCM (2022)
Keyphrases
- search algorithm
- benchmark instances
- search space
- genetic algorithm
- memetic algorithm
- global search
- tabu search
- combinatorial optimization
- evolutionary search
- job shop scheduling problem
- branch and bound algorithm
- hybrid ga
- simulated annealing
- systematic search
- directed graph
- search strategies
- search procedure
- neighborhood search
- optimal solution
- lower bound
- undirected graph
- branch and bound
- minimum weight
- heuristic search
- hooke jeeves
- solving global optimization problems