A branch and bound algorithm for the maximum clique problem.
Luitpold BabelGottfried TinhoferPublished in: ZOR Methods Model. Oper. Res. (1990)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- maximum clique
- test problems
- np hard
- upper bound
- lower bounding
- optimal solution
- precedence constraints
- randomly generated problems
- combinatorial optimization
- branch and bound method
- single machine scheduling problem
- upper bounding
- variable ordering
- finding an optimal solution
- lagrangian relaxation
- mixed integer linear programming
- max sat
- lower and upper bounds
- integer programming
- convex hull
- metaheuristic
- particle swarm optimization
- objective function
- neural network