关于几乎所有子集和问题的一般分枝定界困难性
On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound
摘要:
给定$n$正整数$a_1,a_2,\dots,a_n$和正整数右侧$β$,我们考虑子集和问题的可行性版本,该问题是确定$a_1,a_2,\dots,a_n$的子集相加是否等于$β$的问题.我们表明,如果右手侧$β$被选为$\lfloor r\sum_{j=1}^n a_j \rfloor$为一个常数$0 < r < 1$,如果$a_j$的是独立的,同分布从离散均匀分布采取值${1,2,\dots,\lfloor 10^{n/2} \rfloor }$,则生成的子集和问题的实例需要创建指数数量的分支和的概率,当以任何顺序对个体变元进行分支时,绑定节点将转到$1$,因为$n$将转到无穷大。
英文摘要:
Given $n$ positive integers $a_1,a_2,\dots,a_n$, and a positive integer right hand side $β$, we consider the feasibility version of the subset sum problem which is the problem of determining whether a subset of $a_1,a_2,\dots,a_n$ adds up to $β$. We show that if the right hand side $β$ is chosen as $\lfloor r\sum_{j=1}^n a_j \rfloor$ for a constant $0 < r < 1$ and if the $a_j$'s are independentand identically distributed from a discrete uniform distribution taking values ${1,2,\dots,\lfloor 10^{n/2} \rfloor }$, then the probability that the instance of the subset sum problem generated requires the creation of an exponential number of branch-and-bound nodes when one branches on the individual variables in any order goes to $1$ as $n$ goes to infinity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。