An adaptive multistart tabu search approach to solve the maximum clique problem.
Qinghua WuJin-Kao HaoPublished in: J. Comb. Optim. (2013)
Keyphrases
- tabu search
- benchmark instances
- metaheuristic
- simulated annealing
- scatter search
- feasible solution
- path relinking
- memetic algorithm
- test problems
- scheduling problem
- search algorithm for solving
- genetic algorithm
- hybrid algorithm
- heuristic methods
- quadratic assignment problem
- search algorithm
- vehicle routing problem
- search procedure
- job shop scheduling problem
- tabu search algorithm
- tabu list
- iterated local search
- initial solution
- graph colouring
- variable neighborhood search
- computational complexity
- starting point
- search space
- multidimensional knapsack problem
- optimization problems
- ant colony optimization
- flowshop
- candidate list
- single machine