arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.05392math.OCmath.CO
收藏

针对二元混合整数线性规划的预指定有限k-稀疏分裂集列表的分支方法

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs

Santanu S. Dey, Diego Moran, Jingye Xu

AI总结:

本文研究二元混合整数线性规划分支中k-稀疏分裂集的有限列表支配性质,证明稀疏度为2时存在有限支配列表而更高稀疏度时不存在,并引入覆盖数概念,给出其下界和特定系数族的上界。

摘要:

在对具有稀疏度为2的析取式的二元混合整数线性规划进行分支时,我们观察到存在一个有限的2-稀疏析取式列表,使得任何其他2-稀疏析取式都被该有限列表中的某个析取式所支配。对于稀疏度大于2的情形,我们证明具有这种性质的有限析取式列表不可能存在。这引出了分裂析取式列表的覆盖数的定义。给定一个k-稀疏分裂集有限列表$\mathcal{F}$,以及一个给定的k-稀疏分裂集$S$,令$\mathcal{F}(S)$为列表$\mathcal{F}$中其并集包含$S \cap [0, \\ 1]^n$的最少分裂集个数。令$\mathcal{F}$的覆盖数为所有k-稀疏分裂集$S$上$\mathcal{F}(S)$的最大值。我们证明,对于$k \geq 4$,任何k-稀疏分裂集有限列表的覆盖数至少为$\lfloor k/2\rfloor$。我们还证明,对于$k \leq 4$,系数取自$\{-1, 0, 1\}$的k-稀疏分裂集族的覆盖数上界为$k-1$。

英文摘要:

When branching for binary mixed integer linear programs with disjunctions of sparsity level $2$, we observe that there exists a finite list of $2$-sparse disjunctions, such that any other $2$-sparse disjunction is dominated by one disjunction in this finite list. For sparsity level greater than $2$, we show that a finite list of disjunctions with this property cannot exist. This leads to the definition of covering number for a list of splits disjunctions. Given a finite list of split sets $\mathcal{F}$ of $k$-sparsity, and a given $k$-sparse split set $S$, let $\mathcal{F}(S)$ be the minimum number of split sets from the list $\mathcal{F}$, whose union contains $S \cap [0, \ 1]^n$. Let the covering number of $\mathcal{F}$ be the maximum value of $\mathcal{F}(S)$ over all $k$-sparse split sets $S$. We show that the covering number for any finite list of $k$-sparse split sets is at least $\lfloor k/2\rfloor $ for $k \geq 4$. We also show that the covering number of the family of $k$-sparse split sets with coefficients in $\{-1, 0, 1\}$ is upper bounded by $k-1$ for $k \leq 4$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑