M. Baïou and A. Mahjoub, Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs, SIAM Journal on Discrete Mathematics, vol.10, issue.3, pp.10-13, 1997.
DOI : 10.1137/S0895480193259813

D. Bienstock and G. Muratore, Strong inequalities for capacitated survivable network design problems, Mathematical Programming, pp.89-90, 2000.
DOI : 10.1007/PL00011390
URL : http://firulete.ieor.columbia.edu/reports/techreports/tr-1999-03.ps.gz

M. Biha and A. Mahjoub, Steiner k-edge connected subgraph polyhedra, Journal of Combinatorial Optimization, pp.4-5, 2000.

Q. Botton, B. Fortz, L. Gouveia, and M. Poss, Benders Decomposition for the Hop-Constrained Survivable Network Design Problem, INFORMS Journal on Computing, vol.25, issue.1, pp.25-26, 2013.
DOI : 10.1287/ijoc.1110.0472
URL : https://hal.archives-ouvertes.fr/hal-01255255

C. Bousba and L. Wolsey, Finding minimum cost directed trees with demands and capacities, Annals of operations research, pp.33-37, 1991.

G. Dahl and M. Stoer, A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems, INFORMS Journal on Computing, vol.10, issue.1, pp.10-11, 1998.
DOI : 10.1287/ijoc.10.1.1
URL : http://www.stud.ifi.uio.no/~ftp/publications/pub/preprints/GDahl-2.pdf

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1979.

M. Goemans and D. Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Mathematical Programming, pp.60-61, 1993.
DOI : 10.1007/BFb0120913
URL : http://dspace.mit.edu/bitstream/1721.1/5217/2/OR-225-90.pdf

M. Goemans and Y. Myung, A catalog of steiner tree formulations, Networks, vol.28, issue.1, pp.23-24, 1993.
DOI : 10.1002/9781118627372

M. Grotschel, C. Monma, and M. Stoer, Design of survivable networks, Handbooks in Operations Research and Management Science, pp.617-672, 1995.

A. Hertz, O. Marcotte, A. Mdimagh, M. Carreau, and F. Welt, Optimizing the design of a wind farm collection network, INFOR: Information Systems and Operational Research, pp.50-52, 2012.

F. Hwang, D. Richards, and P. Winter, Steiner tree problems, Networks, vol.20, issue.1, 1992.
DOI : 10.1109/TCT.1973.1083680

H. Kerivin, D. Nace, and J. Geffard, Design of survivable networks with a single facility, 2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563), pp.208-218, 2002.
DOI : 10.1109/ECUMN.2002.1002107

H. Kerivin and A. Mahjoub, Design of Survivable Networks: A survey, Networks, vol.17, issue.1, pp.46-47, 2005.
DOI : 10.1007/BFb0088963

C. Papadimitriou, The complexity of the capacitated tree problem, Networks, pp.8-11, 1978.

A. Pillai, J. Chick, L. Johanning, M. Khorasanchi, and V. De-laleu, Offshore wind farm electrical cable layout optimization, Engineering Optimization, pp.1-20, 2015.
DOI : 10.1080/0305215x.2014.992892
URL : https://strathprints.strath.ac.uk/51422/1/Pillai_etal_EO_2015_Offshore_wind_farm_electrical_cable_layout_optimization.pdf

D. Rajan and A. , Atamtürk, A directed cycle-based column-and-cut generation method for capacitated survivable network design, Networks, pp.43-47, 2004.
DOI : 10.1002/net.20004
URL : http://queue.ieor.berkeley.edu/~atamturk/papers/surv-cyc-cuts2.pdf

H. Ratliff, G. Sicilia, and S. Lubore, Finding the n most vital links in flow networks, Management Science, pp.21-26, 1975.

M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik, vol.68, issue.1, pp.68-69, 1994.
DOI : 10.1007/s002110050054
URL : ftp://ftp.zib.de/pub/zib-publications/reports/SC-93-20.ps