T. Seminario-de-la and R. Latinoamericana, Optimización Discreta y Grafos: Teoría, Algoritmos y Aplicaciones, Sistemas Complejos de Ingeniería Departamento de Ingeniería Industrial

C. Latino-iberoamericano-de-investigación-operativa, C. /. Sbpo, . Río-de-janeiro, and . Brazil, Special Session Speaker (Optimization problems in real-life settings)

A. Agrawal, P. Klein, and R. Ravi, When trees collide, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.440-456, 1995.
DOI : 10.1145/103418.103437

]. E. Alba and M. Tomassini, Parallelism and evolutionary algorithms, IEEE Transactions on Evolutionary Computation, vol.6, issue.5, pp.443-462, 2002.
DOI : 10.1109/TEVC.2002.800880
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.430

F. Alba, M. Almeida, C. Blesa, M. Cotta, I. Díaz et al., Efficient parallel LAN/WAN algorithms for optimization. The mallba project, Parallel Computing, vol.32, issue.5-6, pp.5-6, 2006.
DOI : 10.1016/j.parco.2006.06.007

]. E. Alba, G. Luque, and S. Nesmachnow, Parallel metaheuristics: recent advances and new trends, International Transactions in Operational Research, vol.39, issue.3, pp.1-48, 2013.
DOI : 10.1111/j.1475-3995.2012.00862.x

]. T. Bäck, D. Fogel, and Z. Michalewicz, Handbook of evolutionary computation, p.49, 1997.

]. Balakrishnan, T. L. Magnanti, and P. Mirchandani, A Dual-Based Algorithm for Multi-Level Network Design, Management Science, vol.40, issue.5, pp.567-581, 1930.
DOI : 10.1287/mnsc.40.5.567

]. Balakrishnan, T. L. Magnanti, and P. Mirchandani, Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem, Management Science, vol.40, issue.7, pp.846-867, 1994.
DOI : 10.1287/mnsc.40.7.846

A. Balakrishnan, T. L. Magnanti, and P. Mirchandani, Designing Hierarchical Survivable Networks, Operations Research, vol.46, issue.1, pp.116-136, 1998.
DOI : 10.1287/opre.46.1.116
URL : http://dspace.mit.edu/bitstream/1721.1/5115/1/OR-291-94.pdf

D. Bienstock, E. F. Brickell, and C. L. Monma, -Connected Spanning Networks, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.320-329, 1921.
DOI : 10.1137/0403027
URL : https://hal.archives-ouvertes.fr/in2p3-01321555

]. E. Canale and F. Robledo, Designing Backbone Networks using the Generalized Steiner Problem, IEEE Computer Society Proceedings of 7th IEEE International Workshop on the Design of Reliable Communication Networks, p.23, 2009.

]. A. Córez, Multi-overlay network planning by applying a variable neighbourhood search approach. Master's thesis, Engineering Faculty, p.130, 2010.

F. R. Cruz, G. R. Mateus, J. Macgregor, and . Smith, A Branch-and- Bound Algorithm to Solve a Multi-level Network Optimization Problem, Journal of Mathematical Modelling and Algorithms, vol.2, issue.1, pp.37-56, 2003.
DOI : 10.1023/A:1023670814370

]. L. Davis, Handbook of genetic algorithms. van Nostrand Reinhold, p.49, 1991.

M. Poggi-de-aragão, C. C. Ribeiro, E. Uchoa, and R. F. Werneck, Hybrid local search for the Steiner problem in graphs, Extended Abstracts of the 4th Metaheuristics International Conference, pp.429-433, 2001.

P. Kapali, R. E. Eswaran, and . Tarjan, Augmentation Problems, Society for Industrial and Applied Mathematics (SIAM), vol.5, issue.4, pp.653-665, 1976.

]. T. Feo and M. G. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, vol.8, issue.2, pp.67-71, 1989.
DOI : 10.1016/0167-6377(89)90002-3

]. T. Feo and M. G. Resende, Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, vol.68, issue.2, pp.109-133, 1995.
DOI : 10.1007/BF01096763

]. P. Festa and M. G. Resende, Grasp: An Annotated Bibliography, p.51, 2004.
DOI : 10.1007/978-1-4615-1507-4_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.194.4301

]. M. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of np-completeness, p.129, 1979.

]. Glover, Tabu search and adaptive memory programing ? Advances , applications and challenges, Interfaces in Computer Science and Operations Research, pp.1-75, 1996.
DOI : 10.1007/978-1-4615-4102-8_1

M. and D. Tcha, Optimal design of a distributed network with two-level hierarchical structure, European Journal of Operational Research, vol.62, issue.1, pp.105-115, 1992.

]. D. Kan, A. Narula-tam, and E. Modiano, Lightpath routing and capacity assignment for survivable IP-over-WDM networks. Design of Reliable Communication Networks, pp.37-44, 2009.

A. Koster and S. Orlowski, Single-Layer Cuts for Multi-Layer Network Design Problems, Selected proceedings of the 9th INFORMS Telecommunications Conference, pp.1-23, 2008.
DOI : 10.1007/978-0-387-77780-1_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.6325

. Kubilinskas-2005b-]-eligijus, M. Kubilinskas, and . Pioro, Two design problems for the IP/MPLS over WDM networks, IEEE Xplore, vol.27, p.28, 2005.

]. S. Martins, M. G. Resende, C. C. Ribeiro, and P. M. Pardalos, A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy, Journal of Global Optimization, vol.17, issue.1/4, pp.267-283, 2000.
DOI : 10.1023/A:1026546708757

]. T. Mavridou, P. M. Pardalos, L. S. Pitsoulis, and M. G. Resende, A GRASP for the biquadratic assignment problem, European Journal of Operational Research, vol.105, issue.3, pp.613-621, 1998.
DOI : 10.1016/S0377-2217(97)00083-0

. Clydel, B. Monma, W. Munson, and . Pulleyblank, Minimum-weight two-connected spanning networks, Mathematical Programming, pp.153-171, 1990.

H. Okamura and P. D. Seymour, Multicommodity flows in planar graphs, Journal of Combinatorial Theory, Series B, vol.31, issue.1, pp.75-81, 1981.
DOI : 10.1016/S0095-8956(81)80012-3

]. S. Orlowski, A. M. Koster, C. Raack, and R. Wessäly, Two- Layer Network Design by Branch-and-Cut featuring MIP-based Heuristics, p.25, 2006.

]. P. Pardalos, T. Qian, and M. G. Resende, A Greedy Randomized Adaptive Search Procedure for the feedback vertex set problem, Journal of Combinatorial Optimization, vol.2, issue.4, pp.399-412, 1999.
DOI : 10.1023/A:1009736921890

]. C. Parodi, Integer optimization applied to the design of robust minimum cost multi-layer networks. Master's thesis, Engineering Faculty, p.108, 2011.

]. M. Resende, Computing approximate solutions of the maximum covering problem using GRASP, Journal of Heuristics, vol.4, issue.2, pp.161-171, 1998.
DOI : 10.1023/A:1009677613792

]. M. Resende and C. C. Ribeiro, A GRASP for graph planarization, Journal of Heuristics, vol.4, issue.2, pp.161-171, 1998.
DOI : 10.1023/A:1009677613792

]. M. Resende and C. C. Ribeiro, Greedy Randomized Adaptive Search Procedures, pp.51-130, 2003.
DOI : 10.1007/0-306-48332-7_188
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.2098

]. C. Ribeiro, E. Uchoa, and R. F. Werneck, A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs, INFORMS Journal on Computing, vol.14, issue.3, pp.228-246, 2002.
DOI : 10.1287/ijoc.14.3.228.116

C. Risso, S. Nesmachnow, and F. Robledo, A Parallel Evolutionary Algorithm for Multilayered Robust Network Design, 2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp.291-296, 2012.
DOI : 10.1109/3PGCIC.2012.4

C. Risso, E. Risso, F. Canale, G. Robledo, and . Rubino, Using metaheuristics for planning resilient and cost-effective multilayer networks, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp.90-96, 2013.
DOI : 10.1109/ICUMT.2013.6798427

C. Risso and F. Robledo, Using GRASP for designing a layered network: a real IP/MPLS over DWDM application case, International Journal of Metaheuristics, vol.2, issue.4, pp.392-414, 2013.
DOI : 10.1504/IJMHEUR.2013.058474

C. Risso, F. Robledo, and P. Sartor, Optimal Design of a Multi-Layer Network. An IP/MPLS Over DWDM Application Case. Current Developments in Optical Fiber Technology, pp.3-20, 2013.

C. Risso, E. Canale, and F. Robledo, Optimal design of an IP/MPLS over DWDM network. Pesquisa Operacional -Special Issue from CLAIO, p.32, 2012.

]. M. Ruiz and O. Pedrola, Survivable IP/MPLS-Over-WSON Multilayer Network Optimization, Journal of Optical Communications and Networking, vol.3, issue.8, pp.629-640, 1928.
DOI : 10.1364/JOCN.3.000629
URL : http://hdl.handle.net/2117/13086

D. B. West, Introduction to graph theory, p.44, 1995.

]. P. Winter, Steiner problem in networks: A survey, Networks, vol.19, issue.2, pp.129-167, 1923.
DOI : 10.1002/net.3230170203