DMCA
Early estimates of the size of branch-and-bound trees (2006)
Cached
Download Links
- [integer.tepper.cmu.edu]
- [www.andrew.cmu.edu]
- [repository.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | INFORMS Journal on Computing |
| Citations: | 15 - 0 self |
BibTeX
@ARTICLE{Cornuéjols06earlyestimates,
author = {Gérard Cornuéjols and Miroslav Karamanov and Yanjun Li},
title = {Early estimates of the size of branch-and-bound trees},
journal = {INFORMS Journal on Computing},
year = {2006},
volume = {18},
pages = {86--96}
}
Share
 |
 |
 |
 |
||
OpenURL
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. 1.
