Show simple item record

dc.contributor.authorDiarrassouba, Ibrahima
dc.contributor.authorGabrel, Virginie
dc.contributor.authorMahjoub, Ali Ridha
dc.contributor.authorGouveia, Luis
dc.contributor.authorPesneau, Pierre
dc.date.accessioned2016-10-27T13:32:42Z
dc.date.available2016-10-27T13:32:42Z
dc.date.issued2016
dc.identifier.issn0028-3045
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/15915
dc.language.isoenen
dc.subjectsurvivable networken
dc.subjectedge-disjoint pathsen
dc.subjectflowen
dc.subjecthop-constrained pathen
dc.subjectinteger programming formulationen
dc.subjectk-edge-connecteden
dc.subjectaggregated formulationsen
dc.subjectseparated formulationsen
dc.subject.ddc004en
dc.titleInteger programming formulations for the k-edge-connected 3-hop-constrained network design problemen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this article, we study the k-edge-connected L-hop-constrained network design problem. Given a weighted graph inline image, a set D of pairs of nodes, two integers inline image and inline image, the problem consists in finding a minimum weight subgraph of G containing at least k edge-disjoint paths of length at most L between every pair inline image. We consider the problem in the case where L = 2, 3 and inline image. We first discuss integer programming formulations introduced in the literature. Then, we introduce new integer programming formulations for the problem that are based on the transformation of the initial undirected graph into directed layered graphs. We present a theoretical comparison of these formulations in terms of LP-bound. Finally, these formulations are tested using CPLEX and compared in a computational study for k = 3, 4, 5.en
dc.relation.isversionofjnlnameNetworks
dc.relation.isversionofjnlvol67en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate2016
dc.relation.isversionofjnlpages148-169en
dc.relation.isversionofdoi10.1002/net.21667en
dc.relation.isversionofjnlpublisherJohn Wiley & Sonsen
dc.subject.ddclabelInformatique généraleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2016-09-27T09:45:15Z
hal.person.labIds244433
hal.person.labIds989
hal.person.labIds989
hal.person.labIds30331
hal.person.labIds468470
hal.faultCode{"duplicate-entry":{"hal-01281958":{"doi":"1.0"}}}


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record