Addendum to Vertex adjacencies in the set covering polyhedron

Néstor E. Aguilera; Ricardo D. Katz; Paola B. Tolomei

Addendum to Vertex adjacencies in the set covering polyhedron

Combinatorics 2018-01-08 v2

Authors: Néstor E. Aguilera , Ricardo D. Katz , Paola B. Tolomei

Abstract

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.

Keywords

set covering polyhedron vertex adjacencies up-monotone polyhedron binary vertices integrality 1-skeleton induced subgraph

Cite

@article{arxiv.1710.02491,
  title  = {Addendum to Vertex adjacencies in the set covering polyhedron},
  author = {Néstor E. Aguilera and Ricardo D. Katz and Paola B. Tolomei},
  journal= {arXiv preprint arXiv:1710.02491},
  year   = {2018}
}

Comments

7 pages, minor revision

Addendum to Vertex adjacencies in the set covering polyhedron

Abstract

Keywords

Cite

Comments

Related papers