Show simple item record

dc.contributor.authorYaman, Hande*
dc.contributor.authorÖzkök, Onur*
dc.contributor.authorMahjoub, Ali Ridha*
dc.contributor.authorEkin-Karasan, Oya*
dc.contributor.authorFouilhoux, Pierre*
dc.date.accessioned2012-06-26T12:51:22Z
dc.date.available2012-06-26T12:51:22Z
dc.date.issued2012
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/9581
dc.language.isoenen
dc.subjectreduction operationen
dc.subjectbranch-and-cuten
dc.subjectfaceten
dc.subjectseparationen
dc.subjectsurvivabilityen
dc.subjectHierarchical networken
dc.subject.ddc003en
dc.titleSurvivability in hierarchical telecommunications networksen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherDepartment of Industrial Engineering, Bilkent University;Turquie
dc.contributor.editoruniversityotherLaboratoire LIP6, Université Pierre et Marie Curie;France
dc.description.abstractenThe survivable hierarchical telecommunications network design problem consists of locating concentrators, assigning user nodes to concentrators, and linking concentrators in a reliable backbone network. In this article, we study this problem when the backbone is 2-edge connected and when user nodes are linked to concentrators by a point-to-point access network. We formulate this problem as an integer linear program and present a facial study of the associated polytope. We describe valid inequalities and give sufficient conditions for these inequalities to be facet defining. We investigate the computational complexity of the corresponding separation problems. We propose some reduction operations to speed up the separation procedures. Finally, we devise a branch-and-cut algorithm based on these results and present the outcome of a computational study. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012en
dc.relation.isversionofjnlnameNetworks
dc.relation.isversionofjnlvol59en
dc.relation.isversionofjnlissue1en
dc.relation.isversionofjnldate2012
dc.relation.isversionofjnlpages37-58en
dc.relation.isversionofdoihttp://dx.doi.org/10.1002/net.20479en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherWileyen
dc.subject.ddclabelRecherche opérationnelleen
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*
hal.person.labIds*


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