A note on the Chvátal rank of clique family inequalities

Arnaud Pecher 1, 2 Annegret K. Wagler 3
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Clique family inequalities , form an intriguing class of valid inequalities for the stable set polytopes of all graphs. We prove firstly that their Chvátal-rank is at most a, which provides an alternative proof for the validity of clique family inequalities, involving only standard rounding arguments. Secondly, we strengthen the upper bound further and discuss consequences regarding the Chvátal-rank of subclasses of claw-free graphs.
Document type :
Journal articles
Complete list of metadatas

Contributor : Arnaud Pêcher <>
Submitted on : Tuesday, November 4, 2008 - 2:58:54 PM
Last modification on : Wednesday, February 13, 2019 - 10:32:02 AM
Long-term archiving on : Friday, October 5, 2012 - 11:27:56 AM


Files produced by the author(s)


  • HAL Id : hal-00307758, version 1


Arnaud Pecher, Annegret K. Wagler. A note on the Chvátal rank of clique family inequalities. RAIRO - Operations Research, EDP Sciences, 2007, 41, pp.289--294. ⟨hal-00307758⟩



Record views


Files downloads