An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments.
Etsuji TomitaToshikatsu KamedaPublished in: J. Glob. Optim. (2007)
Keyphrases
- maximum clique
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- combinatorial optimization
- optimal solution
- np hard
- association graph
- precedence constraints
- cutting plane
- mathematical programming
- computational biology
- lagrangian relaxation
- cost function
- optimization problems
- constraint satisfaction problems
- search space
- maximal cliques