Geodesic
A Formulation for a Hop Constrained Survivable Network Design Problem
Yugoslav journal of operations research, Tome 27 (2017) no. 4, p. 427 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

This article presents an integer linear model for the hop constrained node survivable network design problem. The formulation is focused on networks represented by undirected graphs with not rooted demands, considering costs in arcs and in optional (Steiner) nodes, too. The pro- posed model allows setting different values of parameters for constraints between each pair of terminal nodes, including hop length and number of node disjoint paths constraints. This work includes calculating lower and upper bounds to the optimal solution. Since this kind of problems are NP- hard, it is useful to combine the presented formulation with heuristic methods in order to solve effectively large problem instances. The model was tested over the graphs with up to 85 nodes and 148 arcs, in order to validate it in cases with known solution.
Classification : 90B06, 90C05, 90C08
Keywords: Network Design, Hop Constrained, Survivability 
@article{YJOR_2017_27_4_a2,
     author = {Graciela Ferreira and Sergio Nesmachnow and Franco Robledo},
     title = {A {Formulation} for a {Hop} {Constrained} {Survivable} {Network} {Design} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {427 },
     year = {2017},
     volume = {27},
     number = {4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2017_27_4_a2/}
}
TY  - JOUR
AU  - Graciela Ferreira
AU  - Sergio Nesmachnow
AU  - Franco Robledo
TI  - A Formulation for a Hop Constrained Survivable Network Design Problem
JO  - Yugoslav journal of operations research
PY  - 2017
SP  - 427 
VL  - 27
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/YJOR_2017_27_4_a2/
LA  - en
ID  - YJOR_2017_27_4_a2
ER  - 
%0 Journal Article
%A Graciela Ferreira
%A Sergio Nesmachnow
%A Franco Robledo
%T A Formulation for a Hop Constrained Survivable Network Design Problem
%J Yugoslav journal of operations research
%D 2017
%P 427 
%V 27
%N 4
%U http://geodesic.mathdoc.fr/item/YJOR_2017_27_4_a2/
%G en
%F YJOR_2017_27_4_a2
Graciela Ferreira; Sergio Nesmachnow; Franco Robledo. A Formulation for a Hop Constrained Survivable Network Design Problem. Yugoslav journal of operations research, Tome 27 (2017) no. 4, p. 427 . http://geodesic.mathdoc.fr/item/YJOR_2017_27_4_a2/