Vol. 73, n° 1-2, January-February 2018
Content available on Springerlink 

 

Guest editors

Eric Gourdin, Orange, France
Deep Medhi, University of Missouri Kansas-City, USA
Achille Pattavina, Politecnico di Milano, Italy

Editorial

Design of Reliable Communication Networks

Eric Gourdin, Deep Medhi, Achille Pattavina

 

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut

Ibrahima Diarrassouba¹, Meriem Mahjoub^2,3, A. Ridha Mahjoub², Hande Yaman⁴

(1) Normandie Univ, UNIHAVRE, LMAH, FR-CNRS-3335, Le Havre, France
(2) PSL, CNRS UMR 7243 LAMSADE, Université Paris-Dauphine, Paris, France
(3) Faculté des Sciences de Tunis, URAPOP, Université Tunis El Manar, Tunis, Tunisia
(4) Department of Industrial Engineering, Bilkent University, Ankara, Turkey

Abstract Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight subgraph of G such that between every origin and destination there exist at least k node-disjoint paths of length at most L.» Read the summary

Read More