A. Atamtürk and M. Zhang, Two-Stage Robust Network Flow and Design Under Demand Uncertainty, Operations Research, vol.55, issue.4, pp.662-673, 2007.
DOI : 10.1287/opre.1070.0428

F. Babonneau, J. P. Vial, and R. Apparigliato, Handbook on "Uncertainty and Environmental Decision Making", chapter Robust Optimization for environmental and energy planning, International Series in Operations Research and Management Science, 2009.

F. Babonneau, O. Klopfenstein, A. Ouorou, and J. P. Vial, Robust capacity expansion solutions for telecommunications networks with uncertain demands, 2009.

W. Ben-ameur and M. Zotkiewicz, Robust routing and optimal partitioning of a traffic demand polytope, International Transactions in Operational Research, vol.11, issue.4, pp.307-333, 2011.
DOI : 10.1111/j.1475-3995.2010.00764.x
URL : https://hal.archives-ouvertes.fr/hal-00678809

A. Ben-tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, pp.351-376, 2004.
DOI : 10.1007/s10107-003-0454-y

C. Berge, Graphs and Hypergraphs, 1973.

D. Bertsimas and C. Caramanis, Finite Adaptability in Multistage Linear Optimization, IEEE Transactions on Automatic Control, vol.55, issue.12, pp.2751-2766, 2010.
DOI : 10.1109/TAC.2010.2049764

D. Bertsimas and V. Goyal, On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems, Mathematics of Operations Research, vol.35, issue.2, pp.234-305, 2010.
DOI : 10.1287/moor.1090.0440

D. Bertsimas and V. Goyal, On the power and limitations of affine policies in two-stage adaptive optimization, Mathematical Programming, vol.55, issue.2, pp.491-531, 2012.
DOI : 10.1007/s10107-011-0444-4

D. Bertsimas, D. A. Iancu, and P. A. Parrilo, Optimality of Affine Policies in Multistage Robust Optimization, Mathematics of Operations Research, vol.35, issue.2, pp.363-394, 2010.
DOI : 10.1287/moor.1100.0444

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical Programming, vol.98, issue.1-3, 2003.
DOI : 10.1007/s10107-003-0396-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.1682

D. Bertsimas and M. Sim, The Price of Robustness, Operations Research, vol.52, issue.1, pp.35-53, 2004.
DOI : 10.1287/opre.1030.0065

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

A. Billionnet, M. C. Costa, and P. L. , Poirion. 2-Stage Robust MILP with continuous recourse variables, submitted, 2013.

J. R. Birge and F. Louveaux, Introduction to Stochastic Programming, Series in Operations Research and Financial Engineering, 1997.
DOI : 10.1007/978-1-4614-0237-4

R. Boutaba and J. Xiao, Network Management: State of the Art, Proceedings of the World Computer Congress, pp.127-146, 2002.
DOI : 10.1007/978-0-387-35600-6_5

B. Büeler, A. Enge, and K. Fukuda, Exact Volume Computation for Polytopes: A Practical Study, Polytopes -Combinatorics and Computation, DMV Seminar, vol.29, pp.131-154, 2000.

M. Chardy, M. C. Costa, A. Faye, and M. Trampont, Optimizing splitter and fiber location in a multilevel optical FTTH network, European Journal of Operational Research, vol.222, issue.3, pp.430-440, 2012.
DOI : 10.1016/j.ejor.2012.05.024
URL : https://hal.archives-ouvertes.fr/hal-01126129

M. Chardy, M. C. Costa, A. Faye, S. Francfort, C. Hervet et al., La RO au coeur du déploiement du Fiber To The Home à France-Télécom Orange : La RO récompensée par le prix Orange de l'Innovation, Bulletin de la ROADEF, Article Invité, pp.8-11, 2012.

G. B. Dantzig, Linear Programming under Uncertainty, Management Science, vol.1, pp.3-4, 1955.
DOI : 10.1287/mnsc.1040.0261
URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=AD0604612&Location=U2&doc=GetTRDoc.pdf

S. Dempe, Bilevel Programming -A Survey, Discrete Bilevel Optimization Problems, 1996.

V. Gabrel and C. Murat, Robustness and duality in linear programming, Journal of the Operational Research Society, vol.8, issue.8, pp.1288-1296, 2009.
DOI : 10.1002/(SICI)1099-1360(199905)8:3<181::AID-MCDA242>3.0.CO;2-P

V. Gabrel, C. Murat, and N. Remli, Linear programming with interval right hand sides, International Transactions in Operational Research, vol.29, issue.2, pp.397-408, 2010.
DOI : 10.1111/j.1475-3995.2009.00737.x

L. Galand, Méthodes exactes pour l'optimisation multicritère dans les graphes : recherche de solutions de compromis, 2008.

M. R. Garey and D. S. Johnson, Computers and Intractability, A guide to the theory of NP-Completeness, 1979.

S. Gollowitzer, L. Gouveia, and I. Ljubic, The Two Level Network Design Problem with Secondary Hop Constraints, Proceedings of the 5th International Network Optimization Conference, pp.71-76, 2011.
DOI : 10.1007/978-3-642-21527-8_9

S. Gollowitzer and I. Ljubic, MIP models for connected facility location: A theoretical and computational study, Computers & Operations Research, vol.38, issue.2, pp.435-449, 2011.
DOI : 10.1016/j.cor.2010.07.002

C. Hervet and M. Chardy, Passive optical network design under operations administration and maintenance considerations, Journal of Applied Operational Research, vol.4, issue.3, pp.152-172, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00969093

D. A. Iancu, M. Sharma, and M. Sviridenko, Supermodularity and Affine Policies in Dynamic Robust Optimization, Operations Research, vol.61, issue.4
DOI : 10.1287/opre.2013.1172

A. Jarray, B. Jaumard, and A. C. Houle, Minimum CAPEX/OPEX design of optical backbone networks, 2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009.
DOI : 10.1109/ICUMT.2009.5345548

Y. Kim, Y. Lee, L. Han, and J. , A splitter location???allocation problem in designing fiber optic access networks, European Journal of Operational Research, vol.210, issue.2, pp.425-435, 2011.
DOI : 10.1016/j.ejor.2010.10.003

P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, 1997.
DOI : 10.1007/978-1-4757-2620-6

T. L. Magnanti and R. T. Wong, Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria, Operations Research, vol.29, issue.3, pp.464-484, 1981.
DOI : 10.1287/opre.29.3.464

M. Minoux, Robust linear programming with right-hand-side uncertainty, duality and applications (eds) Encyclopedia of Optimization, pp.3317-3327, 2008.

M. Minoux, Robust network optimization under polyhedral demand uncertainty is <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:math>-hard, Discrete Applied Mathematics, vol.158, issue.5, pp.597-603, 2010.
DOI : 10.1016/j.dam.2009.09.025

M. Minoux, On 2-stage robust LP with RHS uncertainty: complexity results and applications, Journal of Global Optimization, vol.3, issue.4, pp.521-537, 2011.
DOI : 10.1007/s10898-010-9645-2

I. Newton, De analysi per aequationes numero terminorum infinitas, 1711.

W. Ogryczak and T. Sliwinski, On solving linear programs with the ordered weighted averaging objective, European Journal of Operational Research, vol.148, issue.1, pp.80-91, 2003.
DOI : 10.1016/S0377-2217(02)00399-5

A. Ouorou, Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty, under revision

G. Polya and G. Szegõ, Aufgaben und Lehrsätze der Analysis [Problems and Theorems in Analysis, 1925.

T. M. Range, An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory, Discussion Papers on Business and Economics 10, 2006.

N. Remli, Robustesse en Programmation Linéaire, thèse soutenue le 17 Mars, 2011.

A. L. Soyster, Technical Note???Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming, Operations Research, vol.21, issue.5, pp.1154-1157, 1973.
DOI : 10.1287/opre.21.5.1154

S. Takriti and S. Ahmed, On robust optimization of two-stage systems, Mathematical Programming, vol.99, issue.1, pp.109-126, 2004.
DOI : 10.1007/s10107-003-0373-y

A. Thiele, T. Terry, and M. Epelman, Robust Linear Optimization With Recourse, 2010.

M. Trampont, Modélisation et optimisation du déploiement des réseaux de télécommunications: application aux réseaux d'accès cuivre et optique, 2009.

F. Vanderbeck, On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm, Operations Research, vol.48, issue.1, pp.111-128, 2000.
DOI : 10.1287/opre.48.1.111.12453
URL : https://hal.archives-ouvertes.fr/inria-00342641

F. Vanderbeck and M. W. Savelsbergh, A generic view of Dantzig???Wolfe decomposition in mixed integer programming, Operations Research Letters, vol.34, issue.3, pp.296-306, 2006.
DOI : 10.1016/j.orl.2005.05.009
URL : https://hal.archives-ouvertes.fr/inria-00342623

Q. Wang, Q. , and W. Li, Solution on OAM of FTTH based on PON, 2009.

B. Zeng and L. Zhao, Solving two-stage robust optimization problems using a column-and-constraint generation method, Operations Research Letters, vol.41, issue.5, pp.457-461, 2013.
DOI : 10.1016/j.orl.2013.05.003

B. Zeng and L. Zhao, An Exact Algorithm for Two-stage Robust Optimization with Mixed Integer Recourse Problems, Optimization Online, 2012.