Early estimates of the size of branch-and-bound trees. (English) Zbl 1241.90090
Summary: We intend 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.
MSC:
90C11 | Mixed integer programming |
90C10 | Integer programming |
90C57 | Polyhedral combinatorics, branch-and-bound, branch-and-cut |
90C35 | Programming involving graphs or networks |