A. Agrawal, P. Klein, and R. Ravi, When trees collide: An approximation algorithm for the generalized steiner problem on networks, SIAM Journal on Computing, vol.24, issue.3, pp.440-456, 1995.
DOI : 10.1137/s0097539792236237

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

K. Charles, M. Alexander, and . Sadiku, Fundamentals of electric circuits, vol.3, 2009.

N. Esther-m-arkin, R. Guttmann-beck, and . Hassin, The (k, k)-capacitated spanning tree problem, Discrete Optimization, vol.9, issue.4, pp.258-266, 2012.

N. Assimakopoulos, A network interdiction model for hospital infection control. Computers in biology and medicine, vol.17, pp.413-422, 1987.

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.505-514, 1997.

A. Barton, Addressing the problem of finding a single vital edge in a maximum flow graph, 2005.

C. Bazgan, S. Toubaline, and D. Vanderpooten, Efficient determination of the k most vital edges for the minimum spanning tree problem, Computers & Operations Research, vol.39, issue.11, pp.2888-2898, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01499698

A. Ben-tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, vol.99, issue.2, pp.351-376, 2004.

C. Bentz, M. Costa, and A. Hertz, On the edge capacitated steiner tree problem, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01465403

C. Bentz, M. Costa, and A. Hertz, On the edge capacitated Steiner tree problem. working paper or preprint, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01465403

C. Berge, Graphes et hypergraphes, 1973.

D. Bertsimas and M. Sim, The price of robustness, Operations research, vol.52, issue.1, pp.35-53, 2004.

C. Berzan, K. Veeramachaneni, J. Mcdermott, and U. Reilly, Algorithms for cable network design on large-scale wind farms, pp.1-24, 2011.

G. Hans, B. Beyer, and . Sendhoff, Robust optimization-a comprehensive survey, Computer methods in applied mechanics and engineering, vol.196, pp.3190-3218, 2007.

D. Bienstock and G. Muratore, Strong inequalities for capacitated survivable network design problems, Mathematical Programming, vol.89, issue.1, pp.127-147, 2000.

D. Biha and A. Mahjoub, Steiner k-edge connected subgraph polyhedra, Journal of Combinatorial Optimization, vol.4, issue.1, pp.131-144, 2000.

A. Billionnet, Optimisation Discrète, de la modélisation à la résolution par des logiciels de programmation mathématique, 2007.

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.13-26, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01255255

C. Bousba, A. Laurence, and . Wolsey, Finding minimum cost directed trees with demands and capacities, Annals of operations research, vol.33, issue.4, pp.285-303, 1991.

T. K-mani-chandy and . Lo, The capacitated minimum spanning tree, Networks, vol.3, issue.2, pp.173-181, 1973.

X. Cheng and D. Du, Steiner trees in industry, vol.11, 2013.

G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing, vol.10, issue.1, pp.1-11, 1998.

E. Stuart, R. Dreyfus, and . Wagner, The steiner problem in graphs, Networks, vol.1, issue.3, pp.195-207, 1971.

D. Du, J. Smith, and . Rubinstein, Advances in Steiner trees, vol.6, 2013.

D. Du and X. Hu, Steiner tree problems in computer communication networks, 2008.

P. Fagerfjäll, Optimizing wind farm layout: more bang for the buck using mixed integer linear programming, 2010.

M. Fischetti and D. Pisinger, Optimizing wind farm cable routing considering power losses, European Journal of Operational Research, vol.270, issue.3, pp.917-930, 2018.

R. Lester, D. R. Ford, and . Fulkerson, Maximal flow through a network, Canadian journal of Mathematics, vol.8, issue.3, pp.399-404, 1956.

N. Greg, R. Frederickson, and . Solis-oba, Increasing the weight of minimum spanning trees, Journal of Algorithms, vol.33, issue.2, pp.244-266, 1999.

N. Harold, . Gabow, X. Michel, D. Goemans, and . Williamson, An efficient approximation algorithm for the survivable network design problem. Mathematical programming, vol.82, pp.13-40, 1998.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of books in the mathematical sciences, 1979.

. Pm-ghare, C. Douglas, . Montgomery, and . Turner, Optimal interdiction policy for a flow network, Naval Research Logistics Quarterly, vol.18, issue.1, pp.37-45, 1971.

F. Glover, Tabu search, ORSA Journal on computing, vol.1, issue.3, pp.190-206, 1989.
URL : https://hal.archives-ouvertes.fr/hal-01389283

X. Michel, D. J. Goemans, and . Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Mathematical Programming, vol.60, issue.1-3, pp.145-166, 1993.

X. Michel, Y. Goemans, and . Myung, A catalog of steiner tree formulations, Networks, vol.23, issue.1, pp.19-28, 1993.

J. Serrano-gonzález, M. Burgos-payán, J. Manuel-riquelme, F. Santos, and . González-longatt, A review and recent developments in the optimal wind-turbine micro-siting problem, Renewable and Sustainable Energy Reviews, vol.30, pp.133-144, 2014.

M. Grotschel, M. Monma, and . Stoer, Design of survivable networks, Handbooks in Operations Research and Management Science, vol.7, 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, vol.50, pp.95-104, 2012.

. Fk-hwang, P. Richards, and . Winter, The Steiner tree problem, Annals of Discrete Mathematics, 1992.

R. Jothi and B. Raghavachari, Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design, ACM Transactions on Algorithms (TALG), vol.1, issue.2, pp.265-282, 2005.

H. Kerivin and . Ridha-mahjoub, Design of survivable networks: A survey, Networks, vol.46, issue.1, pp.1-21, 2005.

P. Kouvelis and G. Yu, Robust discrete optimization and its applications, 1997.

L. Eugene and . Lawler, Combinatorial optimization: networks and matroids. Courier Corporation, 2001.

W. Liang, Finding the k most vital edges with respect to minimum spanning trees for fixed k, Discrete Applied Mathematics, vol.113, issue.2-3, pp.319-327, 2001.

. Stephen-h-lubore, G. T. Ratliff, and . Sicilia, Determining the most vital link in a flow network, Naval Research Logistics Quarterly, vol.18, issue.4, pp.497-502, 1971.

L. Thomas, S. Magnanti, and . Raghavan, Strong formulations for network design problems with connectivity requirements, Networks, vol.45, issue.2, pp.61-79, 2005.

K. Menger, Zur allgemeinen kurventheorie, Fundamenta Mathematicae, vol.10, issue.1, pp.96-115, 1927.
DOI : 10.4064/fm-10-1-96-115

URL : https://www.impan.pl/shop/publication/transaction/download/product/92646?download.pdf

H. Christos and . Papadimitriou, The complexity of the capacitated tree problem, Networks, vol.8, issue.3, pp.217-230, 1978.

A. Cynthia and . Phillips, The network inhibition problem, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp.776-785, 1993.

. Ac-pillai, J. Chick, L. Johanning, M. Khorasanchi, and V. De-laleu, Offshore wind farm electrical cable layout optimization. Engineering Optimization, pp.1-20, 2015.

A. Hans-jürgen-prömel and . Steger, The Steiner tree problem: a tour through graphs, algorithms, and complexity, 2012.

W. Qi, Y. Liang, and Z. Shen, Joint planning of energy storage and transmission for wind energy generation, Operations Research, vol.63, issue.6, pp.1280-1293, 2015.

. S-raghavan, Formulations and algorithms for network design problems with connectivity requirements, 1994.

D. Rajan and A. Atamtürk, A directed cycle-based column-and-cut generation method for capacitated survivable network design, Networks, vol.43, issue.4, pp.201-211, 2004.

T. H-donald-ratliff, S. H. Sicilia, and . Lubore, Finding the n most vital links in flow networks, Management Science, vol.21, issue.5, pp.531-539, 1975.

J. Salmeron, K. Wood, and R. Baldick, Analysis of electric grid security under terrorist threat, IEEE Transactions on power systems, vol.19, issue.2, pp.905-912, 2004.

A. Schrijver, Combinatorial optimization: polyhedra and efficiency, vol.24, 2003.

H. Seifi and M. Sadegh-sepasian, Electric Power System Planning: Issues, Algorithms and Solutions, vol.49, 2011.

K. Steiglitz, P. Weiner, and D. J. Kleitman, The design of minimum-cost vable networks. Circuit Theory, IEEE Transactions on, vol.16, issue.4, pp.455-460, 1969.

M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik, vol.68, issue.1, pp.149-167, 1994.

E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Aragao et al., Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Mathematical Programming, vol.112, issue.2, pp.443-472, 2008.

D. Brent and W. , Introduction to graph theory, vol.2, 2001.

. David-p-williamson, X. Michel, M. Goemans, V. V. Mihail, and . Vazirani, A primaldual approximation algorithm for generalized steiner network problems, Combinatorica, vol.15, issue.3, pp.435-454, 1995.

D. Richard and . Wollmer, Some methods for determining the most vital link in a railway network, 1963.

W. R-kevin, Deterministic network interdiction. Mathematical and Computer Modelling, vol.17, pp.1-18, 1993.

W. R-kevin, Bilevel network interdiction models: Formulations and solutions. Wiley Encyclopedia of Operations Research and Management Science, 2010.

R. Zenklusen, Network flow interdiction on planar graphs, Discrete Applied Mathematics, vol.158, issue.13, pp.1441-1455, 2010.
DOI : 10.1016/j.dam.2010.04.008

URL : https://doi.org/10.1016/j.dam.2010.04.008