A tree-search algorithm for mixed integer programming problems

This paper describes a new algorithm for finding solutions to optimization problems in which some of the variables must take integral values. The algorithm appears to offer some advantages over a similar algorithm proposed by Land and Doig, from which it was developed. The paper describes computational procedures which result in modest storage requirements. The method has been programmed and used to solve several problems.