On the Chvàtal-rank of antiwebs

DOI10.1016/J.ENDM.2010.05.024zbMATH Open1237.90277OpenAlexW1983404504MaRDI QIDQ2883565FDOQ2883565

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

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

zbMATH Keywords

polyhedral combinatoricsstable setsChvàtal-rank

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• 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

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)