#branch-and-bound

Branch and bound is a state space search method, where the branch is checked against estimated bounds on the optimal solution, and is discarded if it cannot produce a better solution than the best one found so far by the algorithm.

https://en.wikipedia.org/wiki/Branch_and_bound http://www.imada.sdu.dk/Employees/jbj/heuristikker/TSPtext.pdf - Branch and Bound Algorithms - Principles and Examples http://stanford.edu/class/ee364b/lectures/bb_slides.pdf - Stanford University lecture