Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra

Published Online:https://doi.org/10.1287/moor.12.3.451

Padberg (Padberg, M. W. 1973. On the facial structure of set packing polyhedra. Math. Programming5 199–215.) has shown that if a graph G with vertex set V constitutes a clique (odd cycle, odd anticycle), then the inequality ΣxVxv ≤ 1 (ΣxVxv ≤ ½(|V| − 1), ΣxVxv ≤ 2) defines a facet of P(ℐST(G)), the convex hull of the incidence vectors of stable sets in G. We generalize the concepts of cliques, odd cycles and anticycles to arbitrary independence systems (E, ℐ) and show that the corresponding inequalities define facets of P(ℐ), the convex hull of the incidence vectors of independent sets.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.