Login / Signup

On the complexity of branch-and-bound search for random trees.

Luc DevroyeCarlos Zamora-Cura
Published in: Random Struct. Algorithms (1999)
Keyphrases
  • branch and bound search
  • branch and bound
  • constraint optimization
  • search algorithm
  • space complexity
  • arc consistency
  • mixed integer linear programs
  • worst case
  • search tree
  • computational complexity
  • upper bound