A new branch-and-bound algorithm for the maximum edge-weighted clique problem.
Pablo San SegundoStefano ConiglioFabio FuriniIvana LjubicPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- weighted graph
- maximum weight
- np hard
- upper bound
- optimal solution
- lower bounding
- upper bounding
- association graph
- combinatorial optimization
- randomly generated problems
- precedence constraints
- mixed integer linear programming
- single machine scheduling problem
- lagrangian relaxation
- max sat
- integer variables
- variable ordering
- finding an optimal solution
- total weight
- column generation
- computational complexity
- search algorithm
- bipartite graph
- search space
- similarity measure
- knn
- euclidean distance
- shortest path
- linear programming