![Improving the efficiency of the Branch and Bound algorithm for integer [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0P6/bigB000P6O3E8.jpg)
Improving the efficiency of the Branch and Bound algorithm for integer [An article from: European Journal of Operational Research]
Book Details
Author(s)I. Derpich, J.R. Vera
PublisherElsevier
ISBN / ASINB000P6O3E8
ISBN-13978B000P6O3E3
AvailabilityAvailable for download now
Sales Rank11,728,684
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper describes a strategy for defining priorities for the branching variables in a Branch and Bound algorithm. The strategy is based on shape information about the polyhedron over which we are optimizing. This information is related to measures of the integer width, as provided by the so called ''Flatness Theorem''. Our selection rule uses that knowledge to define branching priorities on the variables. Computational results with simulated small to medium size integer problems are presented, as well with multi-knapsack problems. These show savings of about 40% in CPU time, as well as in nodes generated in the search tree, and compare favorably with respect to other standard branching rules.
Description:
This paper describes a strategy for defining priorities for the branching variables in a Branch and Bound algorithm. The strategy is based on shape information about the polyhedron over which we are optimizing. This information is related to measures of the integer width, as provided by the so called ''Flatness Theorem''. Our selection rule uses that knowledge to define branching priorities on the variables. Computational results with simulated small to medium size integer problems are presented, as well with multi-knapsack problems. These show savings of about 40% in CPU time, as well as in nodes generated in the search tree, and compare favorably with respect to other standard branching rules.
