On a relaxed maximally disjoint path pair problem: a bicriteria approach

[1]  João C. N. Clímaco,et al.  Finding non-dominated bicriteria shortest pairs of disjoint simple paths , 2009, Comput. Oper. Res..

[2]  Hervé Rivano,et al.  Shared Risk Resource Group Complexity and Approximability Issues , 2007, Parallel Process. Lett..

[3]  Mohammad Javad Rostami,et al.  MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization , 2012, J. Netw. Comput. Appl..

[4]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[5]  Rita Girão-Silva,et al.  Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach , 2016, Photonic Network Communications.

[6]  João C. N. Clímaco,et al.  Multicriteria path and tree problems: discussion on exact algorithms and applications , 2012, Int. Trans. Oper. Res..

[7]  Gaoxi Xiao,et al.  Heuristic for the maximum disjoint paths problem in wavelength-routed networks with shared-risk link groups [Invited] , 2003 .

[8]  Cesar Beltran-Royo,et al.  Solving the edge-disjoint paths problem using a two-stage method , 2020, Int. Trans. Oper. Res..

[9]  Gaoxi Xiao,et al.  Heuristics for Diverse Routing in Wavelength-Routed Networks with Shared Risk Link Groups , 2006, Photonic Network Communications.

[10]  Moufida Maimour,et al.  Maximally radio-disjoint multipath routing for wireless multimedia sensor networks , 2008, WMuNeP '08.

[11]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[12]  Amaro de Sousa,et al.  Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models , 2011, Int. Trans. Oper. Res..

[13]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[14]  Branko Mikac,et al.  Optimizing maximum shared risk link group disjoint path algorithm using NVIDIA CUDA heterogeneous parallel programming platform , 2014, 2014 X International Symposium on Telecommunications (BIHTEL).

[15]  Ernesto de Queirós Vieira Martins,et al.  A new improvement for a K shortest paths algorithm , 2001 .

[16]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..