Early estimates of the size of branch-and-bound trees

Early estimates of the size of branch-and-bound trees

0.00 Avg rating0 Votes
Article ID: iaor2007394
Country: United States
Volume: 18
Issue: 1
Start Page Number: 86
End Page Number: 96
Publication Date: Dec 2006
Journal: INFORMS Journal On Computing
Authors: , ,
Keywords: computational analysis
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.

Reviews

Required fields are marked *. Your email address will not be published.