On the Chvátal-rank of antiwebs

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. © 2010 Elsevier B.V.

Año de publicación:

2010

Keywords:

• Chvátal-rank
• Polyhedral combinatorics
• Stable sets

Fuente:

scopus