On the Chvàtal-rank of antiwebs

DOI10.1016/J.ENDM.2010.05.024MaRDI QIDQ2883565zbMATH OpenOpenAlexFDO

Authors 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

polyhedral combinatoricsstable setsChvàtal-rank

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on the Chvátal-rank of antiwebs
• On the Chvàtal rank of linear relaxations of the stable set polytope
• Antiwebs are rank-perfect
• scientific article; zbMATH DE number 1735804
• Antiweb-wheel inequalities and their separation problems over the stable set polytopes

Cites work

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

Cited in

(3)

• Antiwebs are rank-perfect
• A lower bound on the Chvátal-rank of antiwebs
• On the Chvàtal rank of linear relaxations of the stable set polytope

This page was built for publication: On the Chvàtal-rank of antiwebs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883565)