Show simple item record

dc.contributor.authorFouilhoux, Pierre
HAL ID: 9233
dc.contributor.authorLabbé, Martine
HAL ID: 16695
dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorYaman, Hande
dc.date.accessioned2010-12-14T13:53:26Z
dc.date.available2010-12-14T13:53:26Z
dc.date.issued2009
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/5298
dc.language.isoenen
dc.subjectinteger programmingen
dc.subjectpolyhedral combinatoricsen
dc.subjectindependence system polytopeen
dc.subjectliftingen
dc.subjectnonrank facetsen
dc.subject.ddc003en
dc.titleGenerating Facets for the Independence System Polytopeen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the use of these procedures by deriving strong valid inequalities for the acyclic induced subgraph, triangle free induced subgraph, bipartite induced subgraph, and knapsack polytopes. Finally, we derive a new family of facet-defining inequalities for the independence system polytope by adding a set of edges to antiwebs.en
dc.relation.isversionofjnlnameSIAM Journal on Discrete Mathematics
dc.relation.isversionofjnlvol23en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2009
dc.relation.isversionofjnlpages1484-1506en
dc.relation.isversionofdoihttp://dx.doi.org/10.1137/070695988en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherSIAMen
dc.subject.ddclabelRecherche opérationnelleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record