Show simple item record

dc.contributor.authorDidi Biha, Mohamed
HAL ID: 175567
dc.contributor.authorMahjoub, Ali Ridha
dc.date.accessioned2010-01-14T11:09:32Z
dc.date.available2010-01-14T11:09:32Z
dc.date.issued2004
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2931
dc.language.isoenen
dc.subjectPolytopeen
dc.subjectCuten
dc.subjectk-Edge connected graphen
dc.subjectCritical extreme pointen
dc.subject.ddc003en
dc.titleThe k-edge subgraph problem I: Critical extreme pointsen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversité de Clermont II;France
dc.contributor.editoruniversityotherUniversité d’Avignon;France
dc.description.abstractenIn this paper we consider the linear relaxation of the k-edge connected subgraph polytope, P(G,k), given by the trivial and the so-called cut inequalities. We introduce an ordering on the fractional extreme points of P(G,k) and describe some structural properties of the minimal extreme points with respect to that ordering. Using this we give sufficient conditions for P(G,k) to be integral.en
dc.relation.isversionofjnlnameLinear Algebra and its Applications
dc.relation.isversionofjnlvol381en
dc.relation.isversionofjnldate2004
dc.relation.isversionofjnlpages117-139en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.laa.2003.11.007en
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