arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.0948cs.CCmath.CO
收藏

布尔二次多面体在其它组合多面体中的特殊作用

A special role of Boolean quadratic polytopes among other combinatorial polytopes

Aleksandr Maksimenko

摘要:

我们考虑几个家庭的组合多面体与以下NP-完全问题:最大割,布尔二次规划,二次线性序,二次分配,集划分,集包装,稳定集,3-分配。为了比较两族多面体,我们使用以下方法。我们说族$P$是仿射约化为族$Q$,如果对于每个多面体$p\in P$,存在$q\in Q$使得$p$仿射等价于$q$或$q$的一个面,其中$\dim q = O((\dim p)^k)$对于某个常数$k$。在这种比较下,上述家族被分裂成两个等价类。我们还表明,这两个类是简单的(在上述意义上)比家庭的poytopes以下问题:集覆盖,旅行商,0-1背包问题,3-可满足性,立方子图,偏序。特别是,布尔二次多面体出现在每一个提到的家庭多面体的面。

英文摘要:

We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment. For comparing two families of polytopes we use the following method. We say that a family $P$ is affinely reduced to a family $Q$ if for every polytope $p\in P$ there exists $q\in Q$ such that $p$ is affinely equivalent to $q$ or to a face of $q$, where $\dim q = O((\dim p)^k)$ for some constant $k$. Under this comparison the above-mentioned families are splitted into two equivalence classes. We show also that these two classes are simpler (in the above sence) than the families of poytopes of the following problems: set covering, traveling salesman, 0-1 knapsack problem, 3-satisfiability, cubic subgraph, partial ordering. In particular, Boolean quadratic polytopes appear as faces of polytopes in every of the mentioned families.

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

↑