A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem.
Ciaran McCreeshPatrick ProsserPublished in: CoRR (2014)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- upper bound
- np hard
- test problems
- search tree
- lower bounding
- combinatorial optimization
- optimal solution
- upper bounding
- branch and bound method
- precedence constraints
- single machine scheduling problem
- variable ordering
- search algorithm
- lagrangian relaxation
- mixed integer linear programming
- randomly generated problems
- objective function
- finding an optimal solution
- max sat
- parallel computing
- special case
- shared memory
- multi objective