A parallel branch and bound algorithm for the maximum labelled clique problem.
Ciaran McCreeshPatrick ProsserPublished in: Optim. Lett. (2015)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- optimal solution
- test problems
- lower bounding
- np hard
- upper bound
- precedence constraints
- single machine scheduling problem
- search tree
- randomly generated problems
- lagrangian relaxation
- upper bounding
- combinatorial optimization
- mixed integer linear programming
- variable ordering
- max sat
- branch and bound method
- finding an optimal solution
- maximum weight
- shared memory
- search space
- genetic algorithm
- neural network