A branch and bound algorithm for the maximum clique problem.
Panos M. PardalosGregory P. RodgersPublished in: Comput. Oper. Res. (1992)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- maximum clique
- precedence constraints
- test problems
- lower bounding
- optimal solution
- np hard
- combinatorial optimization
- randomly generated problems
- single machine scheduling problem
- lagrangian relaxation
- mixed integer linear programming
- variable ordering
- max sat
- search algorithm
- lower and upper bounds
- mathematical programming
- linear programming
- optimization problems
- evolutionary algorithm
- search space