Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra

Basit Öğe Kaydı
dc.authoridKutucu, Hakan/0000-0001-7144-7246
dc.contributor.authorDiarrassouba, Ibrahima
dc.contributor.authorKutucu, Hakan
dc.contributor.authorMahjoub, A. Ridha
dc.date.accessioned2024-09-29T15:50:50Z
dc.date.available2024-09-29T15:50:50Z
dc.date.issued2016
dc.departmentKarabük Üniversitesien_US
dc.description.abstractGiven a weighted undirected graph G with a set of pairs of terminals (s(i), t(i)), i = 1, ... , d, and an integer L >= 2, the two node-disjoint hop-constrained survivable network design problem is to find a minimum weight subgraph of G such that between every s(i) and t(i) there exist at least two node-disjoint paths of length at most L. This problem has applications in the design of survivable telecommunication networks with QoS-constraints. We discuss this problem from a polyhedral point of view. We present several classes of valid inequalities along with necessary and/or sufficient conditions for these inequalities to be facet defining. We also discuss separation routines for these classes of inequalities, and propose a Branch-and-Cut algorithm for the problem when L = 3, as well as some computational results. (C) 2016 Wiley Periodicals, Inc.en_US
dc.description.sponsorshipTUBITAK-BIDEB fellowshipen_US
dc.description.sponsorshipContract grant sponsor: TUBITAK-BIDEB fellowshipen_US
dc.identifier.doi10.1002/net.21679
dc.identifier.endpage337en_US
dc.identifier.issn0028-3045
dc.identifier.issn1097-0037
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-84979723931en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage316en_US
dc.identifier.urihttps://doi.org/10.1002/net.21679
dc.identifier.urihttps://hdl.handle.net/20.500.14619/3725
dc.identifier.volume67en_US
dc.identifier.wosWOS:000378507900006en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofNetworksen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectsurvivable networken_US
dc.subjectnode-disjoint pathsen_US
dc.subjecthop constrainten_US
dc.subjectpolyhedronen_US
dc.subjectfaceten_US
dc.subjectBranch-and-Cuten_US
dc.titleTwo Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedraen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu