Show simple item record

dc.contributor.authorDahl, Geir
dc.contributor.authorHuygens, David
dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorPesneau, Pierre
HAL ID: 739311
dc.date.accessioned2009-10-13T09:13:15Z
dc.date.available2009-10-13T09:13:15Z
dc.date.issued2006
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2219
dc.language.isoenen
dc.subjectSurvivable networken
dc.subjectEdge-disjoint pathsen
dc.subjectHop-constrainten
dc.subjectPolyhedronen
dc.subjectFaceten
dc.subject.ddc511en
dc.titleOn the k edge-disjoint 2-hop-constrained paths polytopeen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversité Catholique de Louvain;Belgique
dc.contributor.editoruniversityotherUniversité Blaise Pascal Clermont II;France
dc.contributor.editoruniversityotherUniversité Libre de Bruxelles;Belgique
dc.contributor.editoruniversityotherUniversity of Oslo, Centre of Mathematics for Applications;Norvège
dc.description.abstractenThe k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost subgraph such that between two given nodes s and t there exist at least k edge-disjoint paths of at most 2 edges. We give an integer programming formulation for this problem and characterize the associated polytope.en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol34en
dc.relation.isversionofjnlissue5en
dc.relation.isversionofjnldate2006-09
dc.relation.isversionofjnlpages577-582en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.orl.2005.09.001en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelPrincipes généraux des mathématiquesen


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