整形和修剪树枝和绑定树
Shaping and Trimming Branch-and-bound Trees
摘要：
基于分支的概念，提出了一种求解混合整数线性最优化问题的分支定界型搜索法。虽然类似于经典的分支定界法，但它允许改变潜水中变量的顺序（整形），并从潜水中删除不必要的分支变量（修剪）。正则分支定界算法可以看作是我们新方法的一个特例。我们还讨论了我们的新方法的扩展，例如选择从分支的顶部或底部分支。我们提出了几个数值实验给我们的新方法的潜力的第一印象。
英文摘要：
We present a new branch-and-bound type search method for mixed integer linear optimization problems based on the concept of offshoots (introduced in this paper). While similar to a classic branch-and-bound method, it allows for changing the order of the variables in a dive (shaping) and removing unnecessary branching variables from a dive (trimming). The regular branch-and-bound algorithm can be seen as a special case of our new method. We also discuss extensions to our new method such as choosing to branch from the top or the bottom of an offshoot. We present several numerical experiments to give a first impression of the potential of our new method.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
