An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments.
Etsuji TomitaToshikatsu KamedaPublished in: J. Glob. Optim. (2009)
Keyphrases
- maximum clique
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- np hard
- optimal solution
- combinatorial optimization
- precedence constraints
- lagrangian relaxation
- single machine scheduling problem
- association graph
- cutting plane
- graph theory
- search algorithm
- maximal cliques
- computational biology
- knn
- search space