A branch-and-bound approach for maximum quasi-cliques.
Foad Mahdavi PajouhZhuqi MiaoBalabhaskar BalasundaramPublished in: Ann. Oper. Res. (2014)
Keyphrases
- branch and bound
- quasi cliques
- lower bound
- search algorithm
- branch and bound algorithm
- column generation
- upper bound
- optimal solution
- search space
- combinatorial optimization
- tree search
- branch and bound procedure
- frequently occurring
- randomly generated problems
- network design problem
- branch and bound search
- branch and bound method
- lagrangian heuristic
- graph mining
- tree search algorithm
- neural network
- evolutionary algorithm
- biological networks