A new branch-and-bound algorithm for the Maximum Weighted Clique Problem.
Pablo San SegundoFabio FuriniJorge ArtiedaPublished in: Comput. Oper. Res. (2019)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- maximum weight
- np hard
- upper bound
- optimal solution
- precedence constraints
- lower bounding
- association graph
- combinatorial optimization
- upper bounding
- single machine scheduling problem
- mixed integer linear programming
- total weight
- randomly generated problems
- lagrangian relaxation
- branch and bound method
- max sat
- shortest processing time
- variable ordering
- weighted graph
- integer variables
- knapsack problem
- search space
- computational complexity