On the Chvátal-rank of Antiwebs

https://doi.org/10.1016/j.endm.2010.05.024Get rights and content

Abstract

We present an algorithm for computing both upper and lower bounds on the Chvátal-rank of antiwebs, starting from the edge constraint stable set polytope. With the help of this algorithm we have been able to compute the exact values of the Chvátal-rank for all antiwebs containing up to 5,000 nodes. Moreover, the algorithm can be easily adapted to start from the clique constraint stable set polytope.

References (9)

There are more references available in the full text version of this article.

Cited by (1)

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

    2011, Electronic Notes in Discrete Mathematics
View full text