The method was first proposed by A. H. Land and A. G. Doig[1] in 1960 for discrete programming, and has become the most commonly used tool for solving NP-hard optimization problems.[2] The name "branch and bound" first occurred in the work of Little et al. on the traveling salesman problem.[3][4]