Branch and bound algorithms for the maximum clique problem under a unified framework.
Renato CarmoAlexandre Prusch ZügePublished in: J. Braz. Comput. Soc. (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- randomly generated
- maximum clique
- search tree
- upper bound
- np hard
- optimal solution
- combinatorial optimization
- set covering problem
- variable ordering
- search algorithm
- boolean satisfiability
- finding an optimal solution
- combinatorial problems
- max sat
- genetic algorithm