当前位置: X-MOL 学术Discret. Optim. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On polytopes with linear rank with respect to generalizations of the split closure
Discrete Optimization ( IF 1.1 ) Pub Date : 2024-01-18 , DOI: 10.1016/j.disopt.2023.100821
Sanjeeb Dash , Yatharth Dubey

In this paper we study the rank of polytopes contained in the 0-1 cube with respect to t-branch split cuts and t-dimensional lattice cuts for a fixed positive integer t. These inequalities are the same as split cuts when t=1 and generalize split cuts when t>1. For polytopes contained in the n-dimensional 0-1 cube, the work of Balas implies that the split rank can be at most n, and this bound is tight as Cornuéjols and Li gave an example with split rank n. All known examples with high split rank – i.e., at least cn for some positive constant c<1 – are defined by exponentially many (as a function of n) linear inequalities. For any fixed integer t>0, we give a family of polytopes contained in [0,1]n for sufficiently large n such that each polytope has empty integer hull, is defined by O(n) inequalities, and has rank Ω(n) with respect to t-dimensional lattice cuts. Therefore the split rank of these polytopes is Ω(n). It was shown earlier that there exist generalized branch-and-bound proofs, with logarithmic depth, of the nonexistence of integer points in these polytopes. Therefore, our lower bound results on split rank show an exponential separation between the depth of branch-and-bound proofs and split rank.



中文翻译:

关于分裂闭包的泛化具有线性等级的多胞体

在本文中,我们研究 0-1 立方体中包含的多面体的等级t-分支分裂切割和t固定正整数的维晶格切割t。这些不等式与分割切割相同t=1并概括分裂切割时t>1。对于包含在n-维0-1立方体,Balas的工作意味着分裂等级最多可以是n,并且这个界限很紧,因为 Cornuéjols 和 Li 给出了一个分裂等级的例子n。所有已知的具有高分裂等级的例子 - 即,至少Cn对于一些正常数C<1– 由指数多定义(作为n) 线性不等式。对于任意固定整数t>0,我们给出了包含在[0,1]n对于足够大的n这样每个多面体都有空的整数外壳,定义为n不平等,并且有等级Ωn关于t维晶格切割。因此这些多胞体的分裂等级是Ωn。前面已经表明,存在具有对数深度的广义分支定界证明,证明这些多胞形中不存在整数点。因此,我们对分割等级的下界结果显示分支定界证明和分割等级的深度之间呈指数分离。

更新日期:2024-01-18
down
wechat
bug