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

Author： Pêcher Arnaud   Wagler Annegret K.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|41|3|289-294

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.41, Iss.3, 2007-08, pp. : 289-294

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope

By Braga Mónica   Marenco Javier  

RAIRO - Operations Research, Vol. 50, Iss. 3, 2016-07 ,pp. : 627-644

Edp Sciences

Access to resources Recommend Favorite

A note on Minty type vector variational inequalities

By Crespi Giovanni P.   Ginchev Ivan   Rocca Matteo  

RAIRO - Operations Research, Vol. 39, Iss. 4, 2006-04 ,pp. : 253-273

Edp Sciences

Access to resources Recommend Favorite

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

By Cerioli Marcia R.   Faria Luerbio   Ferreira Talita O.   Protti Fábio  

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 3, 2011-09 ,pp. : 331-346

Edp Sciences

Access to resources Recommend Favorite

Virtual private network design over the first Chvátal closure

By Moradi Ahmad   Lodi Andrea   Mehdi Hashemi S.  

RAIRO - Operations Research, Vol. 49, Iss. 3, 2015-02 ,pp. : 569-588

Edp Sciences

Access to resources Recommend Favorite

Clique-connecting forest and stable set polytopes

By Cornaz Denis  

RAIRO - Operations Research, Vol. 44, Iss. 1, 2010-02 ,pp. : 73-83

Edp Sciences

Access to resources Recommend Favorite