A branch-and-bound algorithm for mixed-integer programming (MIP) is presented in which a different integer variable is designated for branching at each depth in the search tree. This is done in order to achieve economies of scale in solving the linear programming relaxations to obtain bounds for the (MIP) algorithm. This algorithm is the foundation for the zoom software system, which is briefly described. Illustrative computational experience is included. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
No takes yet. Share an insight, caveat, or question.
Singhal et al. (1989) studied this question.