S. Schmid and J. Suomela, Exploiting locality in distributed sdn control», dans Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN '13, pp.121-126, 2013.

R. Urmila and U. Pol, Cloud computing with open source tool :openstack», vol.3, pp.233-240, 2014.

M. Yassin, K. Guillouard, M. Ouzzif, R. Picard, and D. A. , , pp.1344-1351, 2017.

A. Quang, P. T. , J. Sanner, C. Morin, and Y. , «Multi-objective multi-constrained qos routing in large-scale networks: A genetic algorithm approach, dans 2018 International Conference on Smart Communications in Network Technologies (SaCoNeT), pp.55-60, 2018.

D. Arthur and S. Vassilvitskii, «K-means++: The advantages of careful seeding, dans Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pp.1027-1035, 2007.

A. Auger, J. Bader, D. Brockhoff, and E. Zitzler, Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications, », Theor. Comput. Sci, vol.425, pp.75-103, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00638989

J. Bar-ilan and D. Peleg, Approximation algorithms for selecting network centers, pp.343-354, 1991.

J. Bar-ilan and D. Peleg, «Approximation algorithms for selecting network centers (preliminary vesion).», dans WADS, Lecture Notes in Computer Science, vol.519, pp.343-354, 1991.

L. Beineke, O. Oellermann, and R. E. Pippert, , vol.252, pp.31-45, 2002.

L. W. Beineke, O. R. Oellermann, and R. E. Pippert, «The average connectivity of a graph, Discrete Mathematics, vol.252, issue.1, pp.31-45, 2002.

R. H. Bhesdadiya, I. N. Trivedi, P. Jangir, N. Jangir, and A. Kumar, «An nsga-iii algorithm for solving multi-objective economic/environmental dispatch problem, Cogent Engineering, vol.3, issue.1, 2016.

U. Brandes, «A faster algorithm for betweenness centrality», Journal of Mathematical Sociology, vol.25, pp.163-177, 2001.

C. Bron and J. Kerbosch, «Algorithm 457: Finding all cliques of an undirected graph, Commun. ACM, vol.16, pp.575-577, 1973.

G. C. Ciro, F. Dugardin, F. Yalaoui, and R. K. , «A nsga-ii and nsga-iii comparison for solving an open shop scheduling problem with resource constraints, 8th IFAC Conference on Manufacturing Modelling, Management and Control MIM, vol.49, pp.1272-1277, 2016.

J. Crowcroft, «Quality-of-service routing for supporting multimedia applications», IEEE Journal on Selected Areas in Communications, vol.14, issue.7, pp.733-8716, 1996.

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: Nsga-ii, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, pp.182-197, 2002.

J. Edmonds and R. M. Karp, «Theoretical improvements in algorithmic efficiency for network flow problems, J. ACM, vol.19, issue.2, pp.248-264, 1972.

M. Ester, H. Kriegel, J. Sander, and X. Xu, «A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise, dans Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD'96, pp.226-231, 1996.

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

A. Holzinger, D. Blanchard, M. Bloice, K. Holzinger, V. Palade et al., Applying evolutionary algorithms to machine learning techniques, ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) -Volume 02, WI-IAT '14, pp.449-453, 2014.

S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski et al., Experience with a globally-deployed software defined wan», SIGCOMM Comput, vol.4, p.4, 2013.

R. Karp, R. Édité-par, J. Miller, and . Thatcher, Reducibility among combinatorial problems», dans Complexity of Computer Computations, pp.85-103, 1972.

R. M. Karp, T. M. Junger, D. Liebling, G. L. Naddef, W. R. Nemhauser et al., dans 50 Years of Integer Programming

R. M. Karp, «Reducibility among combinatorial problems», dans 50 Years of Integer Programming 1958-2008 -From the Early Years to the State-of-the-Art, pp.219-241, 2010.

N. Kashtan, E. Noor, and U. Alon, «Varying environments can speed up evolution, Proceedings of the National Academy of Sciences, vol.104, pp.13-711, 2007.

S. Khebbache, M. Hadji, and D. Zeghlache, «A multi-objective non-dominated sorting genetic algorithm for vnf chains placement, 15th IEEE Annual Consumer Communications Networking Conference (CCNC), pp.1-4, 2018.

S. Lange, A. Grigorjew, T. Zinner, P. Tran-gia, and M. J. , «A multiobjective heuristic for the optimization of virtual network function chain placement, 29th International Teletraffic Congress (ITC 29), vol.1, pp.152-160, 2017.

A. J. Nebro, J. J. Durillo, and M. Vergne, Redesigning the jmetal multi-objective optimization framework», dans Proceedings of the Companion Publication of the, 2015.

, Annual Conference on Genetic and Evolutionary Computation, GECCO Companion '15, pp.1093-1100

N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck et al., Towards a standard cp modelling language.», dans CP, vol.4741, pp.529-543

N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck et al., Towards a standard cp modelling language», dans Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, CP'07, pp.529-543

M. Otokura, K. Leibnitz, Y. Koizumi, D. Kominami, T. Shimokawa et al., «Application of evolutionary mechanism to dynamic virtual network function placement, IEEE 24th International Conference on Network Protocols (ICNP), pp.1-6, 2016.

P. Tran, A. Sanner, and C. M. , «Virtual network function forwarding graph embedding: A genetic algorithm approach, Saconet speical issues, 2018.

P. T. Quang, K. Piamrat, K. D. Singh, and C. Viho, «Video streaming over ad hoc networks: A qoe-based optimal routing solution, IEEE Transactions on Vehicular Technology, vol.66, issue.2, pp.1533-1546, 2017.

E. Rodriguez-colina, D. Gil-leyva, J. L. Marzo, and V. M. Ramosr, «A bit error rate analysis for tcp traffic over parallel free space photonics, Telecommunication Systems, vol.56, issue.4, pp.455-466, 2014.

M. Sakarovitch, Optimisation combinatoire: Programmation discrète, Collection Enseignement des sciences, 1984.

D. Sharma, P. C. Ppsn-xi, C. Schaefer, J. Cotta, G. Ko?odziej et al., Gpgpu-compatible archive based stochastic ranking evolutionary algorithm (g-asrea) for multi-objective optimization», dans Parallel Problem Solving from Nature, pp.111-120, 2010.

P. J. Stuckey, T. Feydy, A. Schutt, G. Tack, and J. Fischer, The minizinc challenge, vol.35, pp.55-60, 2008.

G. Tack, Constraint Propagation -Models, Techniques, Implementation, 2009.

P. Van-mieghem and F. A. Kuipers, «Concepts of exact qos routing algorithms, IEEE/ACM Transactions on Networking, vol.12, issue.5, pp.851-864, 2004.

E. Zitzler, M. Laumanns, L. T. , K. C. Giannakoglou, D. T. Tsahalis et al., Twas brillig, and the slithy toves Did gyre and gimble in the wabe: All mimsy were the borogoves, And the mome raths outgrabe, «SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization», dans Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, pp.95-100, 2001.

V. Feldman, Evolvability from learning algorithms», dans Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC '08, pp.619-628, 2008.

D. Sharma, P. C. Ppsn-xi, C. Schaefer, J. Cotta, G. Ko?odziej et al., Gpgpu-compatible archive based stochastic ranking evolutionary algorithm (g-asrea) for multi-objective optimization», dans Parallel Problem Solving from Nature, pp.111-120, 2010.

L. Valiant, Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World, p.9780465032716, 2013.