M. Ba¨?ouba¨?ou, F. Barahona, and A. R. Mahjoub, Separation of Partition Inequalities, Mathematics of Operations Research, vol.25, issue.2, pp.243-254, 2000.
DOI : 10.1287/moor.25.2.243.12223

F. Barahona, Separating from the dominant of the spanning tree polytope, Operations Research Letters, vol.12, issue.4, pp.201-203, 1992.
DOI : 10.1016/0167-6377(92)90045-5

F. Barahona and A. R. Mahjoub, On two-connected subgraph polytopes, Discrete Mathematics, vol.147, issue.1-3, pp.19-34, 1995.
DOI : 10.1016/0012-365X(94)00255-H
URL : https://doi.org/10.1016/0012-365x(94)00255-h

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

D. Bienstock, E. F. Brickell, and C. L. Monma, -Connected Spanning Networks, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.320-329, 1990.
DOI : 10.1137/0403027

S. Chopra, -Edge-Connected Spanning Subgraph Polyhedron, SIAM Journal on Discrete Mathematics, vol.7, issue.2, pp.245-259, 1994.
DOI : 10.1137/S0895480191222665

W. H. Cunningham, Optimal attack and reinforcement of a network, Journal of the ACM, vol.32, issue.3, pp.549-561, 1985.
DOI : 10.1145/3828.3829

M. , D. Biha, and A. R. Mahjoub, k-edge connected polyhedra on series-parallel graphs, Operations Research Letters, vol.19, pp.71-78, 1996.
DOI : 10.1016/0167-6377(96)00015-6

B. Fortz, Design of Survivable Networks with Bounded Rings, volume 2 of Network Theory and Applications, 2000.

B. Fortz and M. Labbé, Polyhedral results for two-connected networks with bounded rings, Mathematical Programming, vol.93, issue.1, pp.27-54, 2002.
DOI : 10.1007/s10107-002-0299-9
URL : https://hal.archives-ouvertes.fr/hal-01255601

B. Fortz and M. Labbé, Two-Connected Networks with Rings of Bounded Cardinality, Computational Optimization and Applications, vol.27, issue.2, 2002.
DOI : 10.1023/B:COAP.0000008649.61438.6b
URL : https://hal.archives-ouvertes.fr/hal-01255586

B. Fortz, M. Labbé, and F. Maffioli, Solving the Two-Connected Network with Bounded Meshes Problem, Operations Research, vol.48, issue.6, pp.866-877, 2000.
DOI : 10.1287/opre.48.6.866.12390
URL : https://hal.archives-ouvertes.fr/hal-01255611

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, Journal of the ACM, vol.35, issue.4, pp.921-940, 1988.
DOI : 10.1145/48014.61051

R. E. Gomory and T. C. Hu, Multi-Terminal Network Flows, Journal of the Society for Industrial and Applied Mathematics, vol.9, issue.4, pp.551-570, 1961.
DOI : 10.1137/0109047

M. Grötschel, C. Monma, and M. Stoer, Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints, Operations Research, vol.40, issue.2, pp.309-330, 1992.
DOI : 10.1287/opre.40.2.309

M. Grötschel, C. Monma, and M. Stoer, Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints, SIAM Journal on Optimization, vol.2, issue.3, pp.474-504, 1992.
DOI : 10.1137/0802024

M. Grötschel, C. L. Monma, and M. Stoer, Design of Survivable Networks Handbooks in Operations Research and Management Science, pp.617-672, 1995.

D. Gusfield, Very Simple Methods for All Pairs Network Flow Analysis, SIAM Journal on Computing, vol.19, issue.1, pp.143-155, 1990.
DOI : 10.1137/0219009

J. Hao and J. B. Orlin, A Faster Algorithm for Finding the Minimum Cut in a Directed Graph, Proc. of 3rd ACM-SIAM Symp. on Discrete Algorithms, pp.165-174, 1992.
DOI : 10.1006/jagm.1994.1043

A. Itai, Y. Perl, and Y. Shiloach, The complexity of finding maximum disjoint paths with length constraints, Networks, vol.4, issue.3, pp.277-286, 1982.
DOI : 10.1007/978-1-4684-2001-2_9

K. Jain, A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem, Combinatorica, vol.21, issue.1, pp.39-60, 2001.
DOI : 10.1007/s004930170004

L. Ladányi, T. K. Ralphs, and L. E. Trotter, Computational Combinatorial Optimization: Optimal or Provably Near-Opimal Solutions, Cut, and Price: Sequential and Parallel, pp.223-260, 2001.

A. R. Mahjoub, Two-edge connected spanning subgraphs and polyhedra, Mathematical Programming, vol.16, issue.1-3, pp.199-208, 1994.
DOI : 10.4153/CJM-1956-045-5

C. Monma, B. Munson, and W. Pulleyblank, Minimum-weight two-connected spanning networks, Mathematical Programming, vol.36, issue.1-3, pp.153-171, 1990.
DOI : 10.1007/BF01585735

D. P. Williamson, Lecture notes on approximation algorithms, IBM Research Division, 1999.

D. P. Williamson, M. X. Goemans, M. Mihail, and V. V. Vazirani, A primal-dual approximation algorithm for generalized steiner network problems, Combinatorica, vol.9, issue.3, pp.435-454, 1995.
DOI : 10.1007/BF01299747