An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
Chu Min LiZhe QuanPublished in: AAAI (2010)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- randomly generated
- combinatorial optimization
- lower bounding
- maximum clique
- optimal solution
- np hard
- search tree
- boolean satisfiability
- precedence constraints
- branch and bound method
- single machine scheduling problem
- upper bounding
- randomly generated problems
- finding an optimal solution
- variable ordering
- lagrangian relaxation
- neural network
- mixed integer linear programming
- max sat
- metaheuristic
- special case
- search space