Early Estimates of the Size of Branch-and-Bound Trees
Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li
INFORMS Journal on Computing · 2006 · Volume 18 · Issue 1
Abstract
This paper intends to show that the time needed to solve mixed-integer-programming problems by branch and bound can be roughly predicted early in the solution process. We construct a procedure that can be implemented as part of an MIP solver. It is based on analyzing the partial tree resulting from running the algorithm for a short period of time and predicting the shape of the whole tree. The procedure is tested on instances from the literature. This work was inspired by the practical applicability of such a result.
Keywords
integer programming, branch-and-bound algorithm, analysis of algorithms, computational complexity
Enable JavaScript for citation tools and additional paper interactions.