Successful application of branch-and-bound methods for NP-hard problems Branch and bound is an effective heuristic for search problems, and Wikipedia lists a number of hard problems where branch-and-bound has been used. However, I haven't been able to find references to suggest that it's more than just "one method" for solving these problems. 

Anecdotally, I've heard that some of the best heuristics for SAT and integer programming come from branch and bound, so my question is:


  Can someone point me to any references detailing effective uses of
  branch and bound for NP-hard problems ?
For TSP, checkout this book...
http://www.tsp.gatech.edu/book/index.html

My understanding is that there is no one tool to kill them all. Arguably any recursive solution deploying backtracking and some scoring function is using branch and bound. As such, a large fraction of solvers to NP hard problems use some form of branch and bound.