Abstract: This paper carried out a series of improvements on the traditional branch and bound algorithm.During the searching process of integer solutions,paper researched how to seek the next branch along the fastest descent direction.So,the branch numbers are decreased,and a branch and bound algorithm for solving integer least squares estimation of adjustment model is gave.The numerical results shows that the new algorithm is not only a great improvement on the traditional branch and bound algorithm,but suitable for different complex problems.