Login / Signup

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem.

Chu-Min LiHua JiangFelip Manyà
Published in: Comput. Oper. Res. (2017)
Keyphrases
  • branch and bound algorithm
  • branch and bound
  • lower bound
  • combinatorial optimization
  • np hard
  • programming language
  • search tree
  • search algorithm
  • computational complexity
  • tabu search
  • combinatorial problems