Variable neighborhood search for the maximum clique.
Pierre HansenNenad MladenovicDragan UrosevicPublished in: Discret. Appl. Math. (2004)
Keyphrases
- variable neighborhood search
- maximum clique
- branch and bound algorithm
- single machine scheduling problem
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- association graph
- minimum spanning tree
- maximal cliques
- graph theory
- routing problem
- benchmark instances
- hybrid method
- vehicle routing problem
- computational biology
- optimal solution
- lower bound
- branch and bound
- search procedure
- combinatorial optimization
- precedence constraints
- simulated annealing
- upper bound
- language model
- genetic algorithm
- social network analysis
- test collection
- search algorithm
- np hard