具有有界子行列式的多面体中整数点的计数
Enumerating integer points in polytopes with bounded subdeterminants
摘要:
证明了在多面体的维数和编码长度为时间多项式的情况下,可以枚举出多面体中整数点的凸包的顶点,且多面体的约束矩阵具有有界且非零的子行列式.这扩展了Artmann等人以前的结果,他们表明在这种多面体中整数线性最优化可以在多项式时间内完成。
英文摘要:
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This extends a previous result by Artmann et al. who showed that integer linear optimization in such polytopes can be done in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。