O. Schütze, A new data structure for the nondominance problem in multi-objective optimization, Proceedings of the 2nd International Conference on Evolutionary Multi-criterion Optimization, ser. EMO'03, pp.509-518, 2003.

Q. Zhang and H. Li, MOEA/D: A multiobjective evolutionary algorithm based on decomposition, Evolutionary Computation, vol.11, issue.6, pp.712-731, 2007.

E. Zitzler, M. Laumanns, and L. Thiele, SPEA2: Improving the Strength Pareto Evolutionary Algorithm, Tech. Rep, vol.103, 2001.

C. A. Coello, G. T. Pulido, and M. S. Lechuga, Handling multiple objectives with particle swarm optimization, IEEE Transactions on Evolutionary Computation, vol.8, issue.3, pp.256-279, 2004.

S. Agrawal, B. K. Panigrahi, and M. K. Tiwari, Multiobjective particle swarm algorithm with fuzzy clustering for electrical power dispatch, IEEE Transactions on Evolutionary Computation, vol.12, issue.5, pp.529-541, 2008.

B. Li, K. Tang, J. Li, and X. Yao, Stochastic ranking algorithm for many-objective optimization based on multiple indicators, IEEE Transactions on Evolutionary Computation, vol.20, issue.6, pp.924-938, 2016.

X. Cai, Y. Li, Z. Fan, and Q. Zhang, An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization, IEEE Transactions on Evolutionary Computation, vol.19, issue.4, pp.508-523, 2015.

S. Yang, M. Li, X. Liu, and J. Zheng, A grid-based evolutionary algorithm for many-objective optimization, IEEE Transactions on Evolutionary Computation, vol.17, issue.5, pp.721-736, 2013.

L. Tang and X. Wang, A hybrid multiobjective evolutionary algorithm for multiobjective optimization problems, IEEE Transactions on Evolutionary Computation, vol.17, issue.1, pp.20-45, 2013.

S. Mostaghim and J. Teich, Quad-trees: A data structure for storing Pareto sets in multiobjective evolutionary algorithms with elitism, Advanced Information and Knowledge, pp.81-104, 2004.

J. Fieldsend, R. Everson, and S. Singh, Using unconstrained elite archives for multiobjective optimization, IEEE Transactions on Evolutionary Computation, vol.7, issue.3, pp.305-323, 2003.

W. Brockhoff, Theoretical aspects of evolutionary multiobjective optimization, Theory of Randomized Search Heuristics: Foundations and Recent Developments, pp.101-139, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00414333

H. T. Kung, F. Luccio, and F. P. Preparata, On finding the maxima of a set of vectors, J. ACM, vol.22, issue.4, pp.469-476, 1975.

H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems, Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, ser. STOC '84, pp.135-143, 1984.

F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, 1985.

P. Gupta, R. Janardan, M. Smid, and B. Dasgupta, The rectangle enclosure and point-dominance problems revisited, International Journal of Computational Geometry & Applications, vol.7, issue.5, pp.437-455, 1997.

K. Deb, M. Mohan, and S. Mishra, Evaluating the-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions, Evol. Comput, vol.13, issue.4, pp.501-525, 2005.

L. Paquete, M. Chiarandini, and T. Stützle, Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study, Lecture Notes in Economics and Mathematical Systems, vol.535, pp.177-199, 2004.

M. Drozdík, Y. Akimoto, H. Aguirre, and K. Tanaka, Computational cost reduction of nondominated sorting using the M-front, IEEE Transactions on Evolutionary Computation, vol.19, issue.5, pp.659-678, 2015.

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.

M. Jensen, Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms, IEEE Transactions on Evolutionary Computation, vol.7, issue.5, pp.503-515, 2003.

F. Fortin, S. Grenier, and M. Parizeau, Generalizing the improved run-time complexity algorithm for non-dominated sorting, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp.615-622, 2013.

O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, Covering Pareto sets by multi-level evolutionary subdivision techniques, Proceedings of the Second Int. Conf. on Evolutionary Multi-Criterion Optimization, pp.118-132, 2003.

J. E. Fieldsend, R. M. Everson, and S. Singh, Using unconstrained elite archives for multiobjective optimization, IEEE Transactions on Evolutionary Computation, vol.7, issue.3, pp.305-323, 2003.

N. Altwaijry and M. Bachir-menai, Data structures in multi-objective evolutionary algorithms, Journal of Computer Science and Technology, vol.27, issue.6, pp.1197-1210, 2012.

S. Mostaghim, J. Teich, and A. Tyagi, Comparison of data structures for storing Pareto-sets in MOEAs, Evolutionary Computation, 2002. CEC '02, vol.1, pp.843-848, 2002.

W. Habenicht, Essays and Surveys on MCDM: Proceedings of the Fifth International Conference on Multiple Criteria Decision Making

B. Mons, Quad Trees, a Datastructure for Discrete Vector Optimization Problems, pp.136-145, 1982.

M. Sun and R. Steuer, Quad trees and linear list for identifying nondominated criterion vectors, INFORM Journal on Computing, vol.8, issue.4, pp.367-375, 1996.

K. Deb and H. Jain, An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints, IEEE Transactions on Evolutionary Computation, vol.18, issue.4, pp.577-601, 2014.

X. Zhang, Y. Tian, R. Cheng, and Y. Jin, An efficient approach to nondominated sorting for evolutionary multiobjective optimization, IEEE Transactions on Evolutionary Computation, vol.19, issue.2, pp.201-213, 2015.

Y. Zhou, Z. Chen, and J. Zhang, Ranking vectors by means of the dominance degree matrix, IEEE Transactions on Evolutionary Computation, vol.21, issue.1, pp.34-51, 2017.