Addendum to "Vertex adjacencies in the set covering polyhedron" [Discrete Appl. Math. 218(2017) 40-56].

Discrete Applied Mathematics(2018)

引用 0|浏览7
暂无评分
摘要
We study the relationship between the vertices of an up-monotone polyhedron R and those of the polytope P obtained by truncating R with the unit hypercube. When R has binary vertices, we characterize the vertices of P in terms of the vertices of R, show their integrality, and prove that the 1-skeleton of R is an induced subgraph of the 1-skeleton of P. We conclude by applying our findings to settle a claim in the original paper.
更多
查看译文
关键词
Polyhedral combinatorics,Set covering polyhedron,Vertex adjacency
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要