Solving the maximum clique problem using a tabu search approach.
Michel GendreauPatrick SorianoLouis SalvailPublished in: Ann. Oper. Res. (1993)
Keyphrases
- tabu search
- benchmark instances
- simulated annealing
- metaheuristic
- search heuristics
- feasible solution
- combinatorial optimization
- memetic algorithm
- path relinking
- scheduling problem
- genetic algorithm
- test problems
- search algorithm for solving
- hybrid algorithm
- search algorithm
- vehicle routing problem
- tabu search algorithm
- heuristic methods
- job shop scheduling problem
- initial solution
- quadratic assignment problem
- multi start
- branch and bound algorithm
- iterated local search
- variable neighborhood search
- tabu list
- scatter search
- search procedure
- timetabling problem
- flowshop
- candidate list
- ant colony optimization
- multidimensional knapsack problem
- evolutionary algorithm
- job shop
- mixed integer program
- search space
- max sat
- traveling salesman problem
- combinatorial optimization problems
- benchmark problems