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

Mahjoub, Ali Ridha; Kutucu, Hakan; Diarrassouba, Ibrahima

Mahjoub, Ali Ridha; Kutucu, Hakan; Diarrassouba, Ibrahima (2013), Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra, Electronic Notes in Discrete Mathematics, 41, p. 551-558. http://dx.doi.org/10.1016/j.endm.2013.05.137

Type

Article accepté pour publication ou publié

External document link

http://hal.archives-ouvertes.fr/hal-00874354

Date

2013

Journal name

Electronic Notes in Discrete Mathematics

Volume

Publisher

Elsevier

Pages

551-558

Abstract (EN)

Given a weighted undirected graph G with a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable network design problem (TNHNDP) is to find a minimum weight subgraph of G such that between every si and ti there exist at least two node-disjoint paths of length at most L. This problem has applications to the design of survivable telecommunications 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. Using this, we propose a Branch-and-Cut algorithm for the problem when L = 3, and present some computational results.

Subjects / Keywords

branch and cut; hop constraint; node-disjoint paths; Survivable network