Login / Signup

A study of parallel branch-and-bound algorithms with best-bound-first search.

José M. TroyaM. Ortega
Published in: Parallel Comput. (1989)
Keyphrases
  • branch and bound algorithm
  • search space
  • lower bound
  • neural network
  • search algorithm
  • microarray
  • search strategy
  • search strategies
  • search tree
  • set covering problem