Show simple item record

dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorNocq, Charles
dc.date.accessioned2010-04-13T08:25:12Z
dc.date.available2010-04-13T08:25:12Z
dc.date.issued1999
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3947
dc.language.isoenen
dc.subjectCuten
dc.subjectPolytopesen
dc.subjectCritical extreme pointen
dc.subject2-node connected graphen
dc.subject.ddc003en
dc.titleOn the linear relaxation of the 2-node connected subgraph polytopeen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper, we study the linear relaxation P(G) of the 2-node connected subgraph polytope of a graph G. We introduce an ordering on the fractional extreme points of P(G) and we give a characterization of the minimal extreme points with respect to that ordering. This yields a polynomial method to separate a minimal extreme point of P(G) from the 2-node connected subgraph polytope. It also provides a new class of facet defining inequalities for this polytope.en
dc.relation.isversionofjnlnameDiscrete Applied Mathematics
dc.relation.isversionofjnlvol95en
dc.relation.isversionofjnlissue1-3en
dc.relation.isversionofjnldate1999-07
dc.relation.isversionofjnlpages389-416en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/S0166-218X(99)00088-8en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
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