R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows: theory, algorithms, and applications, 1993.

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.197.7390

D. Coudert, P. Datta, S. Perennes, H. Rivano, and M. Voge, SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES, Parallel Processing Letters, vol.17, issue.02, pp.169-184, 2007.
DOI : 10.1142/S0129626407002958
URL : https://hal.archives-ouvertes.fr/inria-00070167

D. Coudert, S. Perennes, H. Rivano, and M. Voge, Shared Risk Resource Groups and Survivability in Multilayer Networks, 2006 International Conference on Transparent Optical Networks, pp.235-238, 2006.
DOI : 10.1109/ICTON.2006.248442
URL : https://hal.archives-ouvertes.fr/inria-00429170

D. Coudert, S. Perennes, H. Rivano, and M. Voge, Shared risk resource groups and colored graph: Polynomial cases and transformation issues, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00175143

P. Datta and A. K. Somani, Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks, First International Conference on Broadband Networks, pp.120-129, 2004.
DOI : 10.1109/BROADNETS.2004.34

G. Even, G. Kortsarz, and W. Slany, On network design problems: fixed cost flows and the covering steiner problem, ACM Transactions on Algorithms, vol.1, issue.1, pp.74-101, 2005.
DOI : 10.1145/1077464.1077470

A. Faragó, A graph theoretic model for complex network failure scenarios, Proceedings of the Eighth INFORMS Telecommunications Conference, 2006.

J. Lalande, M. Syska, and Y. Verhoeven, Mascopt -a network optimization library: Graph manipulation, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00069887

C. Liu and L. Ruan, p-cycle design in survivable WDM networks with shared risk link groups (SRLGs) Photonic Network Communications, pp.301-311, 2006.

T. Noronha and C. Ribeiro, Routing and wavelength assignment by partition coloring, European Journal of Operational Research, vol.1713, issue.3, pp.797-810, 2006.
DOI : 10.1016/j.ejor.2004.09.007

S. Orlowski and M. Pioro, Primal and dual formulations of network reconfiguration problems and related path generation issues. manuscript, 2007.

D. Papadimitriou, F. Poppe, J. Jones, S. Venkatachalam, S. Dharanikota et al., Inference of shared risk link groups. IETF Draft, OIF Contribution, pp.2001-066

S. Ramamurthy and B. Mukherjee, Survivable WDM mesh networks. Part I-Protection, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), pp.744-751, 1999.
DOI : 10.1109/INFCOM.1999.751461
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.3976

L. Shen, X. Yang, and B. Ramamurthy, Shared-risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: formulation and solution approaches, OptiComm 2003: Optical Networking and Communications, pp.918-931, 2005.
DOI : 10.1117/12.533306

M. Voge, How to Transform a Multilayer Network into a Colored Graph, 2006 International Conference on Transparent Optical Networks, pp.116-119, 2006.
DOI : 10.1109/ICTON.2006.248415

S. Yuan, S. Varma, and J. P. Jue, Minimum-color path problems for reliability in mesh networks, IEEE INFOCOM, pp.2658-2669, 2005.