.png){kind=icon}
返回
Improving the efficiency of the Branch and Bound algorithm for integer programming based on flatness information
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.02.051.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
discrete optimization
Branch and Bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Allogeneic Lymphocytes Persist and Traffic in Feral MHC-Matched Mauritian Cynomolgus Macaques.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容