NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem.
Neda MohammadiMehdi KadivarPublished in: IEEE Access (2020)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- maximum clique
- upper bound
- randomly generated
- np hard
- search tree
- optimal solution
- combinatorial optimization
- exact methods
- set covering problem
- combinatorial problems
- exact solution
- max sat
- finding an optimal solution
- objective function
- boolean satisfiability
- evolutionary algorithm
- genetic algorithm
- backtrack search
- neural network