Show simple item record

dc.contributor.authorBaïou, Mourad
dc.contributor.authorMahjoub, Ali Ridha
dc.date.accessioned2010-04-12T08:27:02Z
dc.date.available2010-04-12T08:27:02Z
dc.date.issued1997
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/3916
dc.language.isoenen
dc.subjectSeries-parallel graphsen
dc.subjectConnected subgraphsen
dc.subjectPolytopesen
dc.subject.ddc003en
dc.titleSteiner 2-edge connected subgraph polytopes on series-parallel graphsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenGiven a graph G=(V,E) with weights on its edges and a set of specified nodes $S\subseteq V$, the Steiner 2-edge survivable network problem is to find a minimum weight subgraph of G such that between every two nodes of S there are at least two edge-disjoint paths. This problem has applications to the design of reliable communication and transportation networks. In this paper, we give a complete linear description of the polytope associated with the solutions to this problem when the underlying graph is series-parallel. We also discuss related polyhedra.en
dc.relation.isversionofjnlnameSIAM Journal on Discrete Mathematics
dc.relation.isversionofjnlvol10en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate1997
dc.relation.isversionofjnlpages505-514en
dc.relation.isversionofdoihttp://dx.doi.org/10.1137/S0895480193259813en
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