On the Chvátal-rank of Antiwebs

DOI10.1016/j.endm.2010.05.024zbMath1237.90277OpenAlexW1983404504MaRDI QIDQ2883565

Eugenia Holm, Luis M. Torres, Annegret K. Wagler

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.024

zbMATH Keywords

stable setspolyhedral combinatoricsChvàtal-rank

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

A lower bound on the Chvátal-rank of Antiwebs

Cites Work

• On cutting-plane proofs in combinatorial optimization
• A class of facet producing graphs for vertex packing polyhedra
• On certain polytopes associated with graphs
• Antiwebs are rank-perfect
• Anti-blocking polyhedra
• Edmonds polytopes and a hierarchy of combinatorial problems
• Perfect zero–one matrices

This page was built for publication: On the Chvátal-rank of Antiwebs