Gouveia L., Patrício P., de Sousa A.F., "Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM", Networks and Spatial Economics, Vol. 8, No. 1, pp. 3-21, March 2008


Return to Homepage


Citations:

1.      Xiao-mei C., Sheng W., Xiong W., Dan L., “Link-Disjoint QoS Routing Algorithm”, International Conference on Communications, Circuits and Systems (ICCCAS 2009), Milpitas, California, USA, 23-25 July 2009, pages 382-386

2.      Borne S., Gourdin E., Klopfenstein O., Mahjoub A.R., “The Multilayer Capacitated Survivable IP Network Design Problem: valid inequalities and Branch-and-Cut”, International Network Optimization Conference (INOC), Pisa, Italy, April 2009

3.      Bendali F., Diarrassouba I., Mahjoub A.R., Mailfert J., “The k edge-disjoint 3-hop-constrained paths polytope”, Discrete Optimization, Elsevier, 2010, doi: 10.1016/j.disopt.2010.05.001

4.      Bley A., Neto J., “Approximability of 3- and 4-hop bounded disjoint paths problems”, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Springer, Vol. 6080, 2010, pages 205-218

5.      Mattia S., “Solving survivable two-layer network design problems by metric inequalities”, Journal on Computational Optimization and Applications, online first (DOI: 10.1007/s10589-010-9364-0), 2010

6.      Kim H., “P-hub protection models for survivable hub network design”, Journal of Geographical Systems, online first (DOI: 10.1007/s10109-011-0157-5), 2011

7.      Gomes T., Simões C., Fernandes L., “Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost”, Journal on Telecommunication Systems, online first (DOI: 10.1007/s11235-011-9574-5), 2011

8.      Nolz P.C., Semet F., Doerner K.F., “Risk approaches for delivering disaster relief supplies”, OR Spectrum, Vol. 33, No. 3, 2011, pages 543-569

 

Return to Homepage