Afficher la notice abrégée

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
dc.contributor.authorPECHER, Arnaud
hal.structure.identifierInstitute for Mathematical Optimization [IMO]
dc.contributor.authorWAGLER, Annegret K.
dc.date.accessioned2024-04-04T02:48:11Z
dc.date.available2024-04-04T02:48:11Z
dc.date.created2007
dc.date.issued2007
dc.identifier.issn0399-0559
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/191716
dc.description.abstractEnClique 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.
dc.language.isoen
dc.publisherEDP Sciences
dc.title.enA note on the Chvátal rank of clique family inequalities
dc.typeArticle de revue
dc.subject.halInformatique [cs]/Autre [cs.OH]
bordeaux.journalRAIRO - Operations Research
bordeaux.page289--294
bordeaux.volume41
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-00307758
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00307758v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=RAIRO%20-%20Operations%20Research&rft.date=2007&rft.volume=41&rft.spage=289--294&rft.epage=289--294&rft.eissn=0399-0559&rft.issn=0399-0559&rft.au=PECHER,%20Arnaud&WAGLER,%20Annegret%20K.&rft.genre=article


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée