F. S. Al-qunaieer, H. R. Tizhoosh, and S. Rahnamayan, Opposition based computing -A survey, Proceedings of International Joint Conference on Neural Networks (IJCNN-2010), pp.1-7, 2010.

R. Aringhieri, R. Cordone, and Y. Melzani, Tabu search versus GRASP for the maximum diversity problem, A Quarterly Journal of Operations Research, vol.6, issue.1, pp.45-60, 2008.

R. Aringhieri, M. Bruglieri, and R. Cordone, Optimal results and tight bounds for the maximum diversity problem, Foundation of Computing and Decision Sciences, vol.34, issue.2, pp.73-85, 2009.

R. Aringhieri and R. Cordone, Comparing local search metaheuristics for the maximum diversity problem, Journal of the Operational Research Society, vol.62, issue.2, pp.266-280, 2011.

M. Aziz, M. Tayarani, and -. , Opposition-based magnetic optimization algorithm with parameter adaptation strategy, Swarm and Evolutionary Computation, vol.26, pp.97-119, 2016.

R. Bellio, L. D. Gaspero, and A. Schaerf, Design and statistical analysis of a hybrid local search algorithm for course timetabling, Journal of Scheduling, vol.15, issue.1, pp.49-61, 2012.

U. Benlic and J. K. Hao, A multilevel memetic approach for improving graph k-partitions, IEEE Transactions Evolutionary Computation, vol.15, issue.5, pp.624-642, 2011.

J. Brimberg, N. Mladenovi?, D. Uro?evi?, and E. Ngai, Variable neighborhood search for the heaviest k-subgraph, Computers & Operations Research, vol.36, issue.11, pp.2885-2891, 2009.

X. Chen, Y. Ong, M. Lim, and K. C. Tan, A multi-facet survey on memetic computation, IEEE Transactions Evolutionary Computation, vol.15, issue.5, pp.591-607, 2011.

Y. Chen and J. K. Hao, Memetic search for the generalized quadratic multiple knapsack problem, IEEE Transactions on Evolutionary Computation, vol.20, issue.6, pp.908-923, 2016.

A. R. De-freitas, F. G. Guimarães, R. C. Silva, and M. J. Souza, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, Optimization Letters, vol.8, issue.2, pp.705-714, 2014.

J. Dem?ar, Statistical comparisons of classifiers over multiple data sets, Journal of Machine Learning Research, vol.7, pp.1-30, 2006.

A. Duarte and R. Martí, Tabu search and GRASP for the maximum diversity problem, European Journal of Operational Research, vol.178, issue.1, pp.71-84, 2007.

M. Ergezer and D. Simon, Oppositional biogeography-based optimization for combinatorial problems, Proceedings of Congress on Evolutionary Computation (CEC-2011), pp.1496-1503, 2011.

U. Feige, D. Peleg, and G. Kortsarz, The dense k-subgraph problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001.

P. Galinier, Z. Boujbel, and M. C. Fernandes, An efficient memetic algorithm for the graph partitioning problem, Annals of Operations Research, vol.191, issue.1, pp.1-22, 2011.

M. Gallego, A. Duarte, M. Laguna, and R. Martí, Hybrid heuristics for the maximum diversity problem, Computational Optimization and Applications, vol.44, issue.3, pp.411-426, 2009.

J. B. Ghosh, Computational aspects of the maximum diversity problem, Operations Research Letters, vol.19, issue.4, pp.175-181, 1996.

F. Glover, E. Taillard, and D. De-werra, A Users Guide to Tabu Search, Annals of Operations Research, vol.41, pp.12-37, 1993.

F. Glover and M. Laguna, Tabu search, 1997.
URL : https://hal.archives-ouvertes.fr/hal-02309983

F. Glover, A Template for Scatter Search and Path Relinking," in Artificial Evolution, Lecture Notes in Computer Science, pp.13-54, 1363.

F. Glover, C. Kuo, and K. S. Dhir, Heuristic algorithms for the maximum diversity problem, Journal of Information and Optimization Sciences, vol.19, issue.1, pp.109-132, 1998.

D. Gusfield, Partition-distance: A problem and class of perfect graphs arising in clustering, Information Processing Letters, vol.82, issue.3, pp.159-164, 2002.

J. K. Hao, Memetic algorithms in discrete optimization, Handbook of Memetic Algorithms, vol.379, pp.73-94, 2012.

Y. Jin, Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm and Evolutionary Computation, vol.1, issue.2, pp.61-70, 2011.

L. Kotthoff, I. P. Gent, and I. Miguel, An evaluation of machine learning in algorithm selection for search problems, AI Communications, vol.25, issue.3, pp.257-270, 2012.

N. Krasnogor and J. Smith, A tutorial for competent memetic algorithms: model, taxonomy, and design issues, IEEE Transactions Evolutionary Computation, vol.9, issue.5, pp.474-488, 2005.

C. C. Kuo, F. Glover, and K. S. Dhir, Analyzing and modeling the maximum diversity problem by zero-one programming, Decision Sciences, vol.24, issue.6, pp.1171-1185, 1993.

K. Leyton-brown, H. H. Hoos, F. Hutter, and L. Xu, Understanding the empirical hardness of NP-complete problems, Communications of the ACM, vol.57, issue.5, pp.98-107, 2014.

M. Lozano, D. Molina, and C. García-martínez, Iterated greedy for the maximum diversity problem, European Journal of Operational Research, vol.214, issue.1, pp.31-38, 2011.

Z. Lü and J. K. Hao, A memetic algorithm for graph coloring, European Journal of Operational Research, vol.203, issue.1, pp.241-250, 2010.

E. M. Macambira, C. C. De, and . Souza, The edge-weighted clique problem: valid inequalities, facets and polyhedral computations, European Journal of Operational Research, vol.123, issue.2, pp.346-371, 2000.

E. M. Macambira, An application of tabu search heuristic for the maximum edge-weighted subgraph problem, Annals of Operations Research, vol.117, issue.1-4, pp.175-190, 2002.

R. Martí, M. Gallego, and A. Duarte, A branch and bound algorithm for the maximum diversity problem, European Journal of Operational Research, vol.200, issue.1, pp.36-44, 2010.

R. Martí, M. Gallego, A. Duarte, and E. G. Pardo, Heuristics and metaheuristics for the maximum diversity problem, Journal of Heuristics, vol.19, issue.4, pp.591-615, 2013.

P. Moscato, Memetic algorithms: A short introduction, New Ideas in Optimization, pp.219-234, 1999.

M. N. Omidvar, X. Li, Y. Mei, and X. Yao, Cooperative co-evolution with differential grouping for large scale optimization, IEEE Transactions on Evolutionary Computation, vol.18, issue.3, pp.378-393, 2014.

G. Palubeckis, Iterated tabu search for the maximum diversity problem, Applied Mathematics and Computation, vol.189, issue.1, pp.371-383, 2007.

O. A. Prokopyev, N. Kong, and D. L. Martinez-torres, The equitable dispersion problem, European Journal of Operational Research, vol.197, issue.1, pp.59-67, 2009.

S. Rahnamayan, H. R. Tizhoosh, and M. Salama, Opposition-based differential evolution, IEEE Transactions Evolutionary Computation, vol.12, issue.1, pp.64-79, 2008.

S. Rahnamayan, H. R. Tizhoosh, and M. M. Salama, Opposition versus randomness in soft computing techniques, Applied Soft Computing, vol.8, issue.2, pp.906-918, 2008.

S. Rahnamayan, G. G. Wang, and M. Ventresca, An intuitive distance-based explanation of opposition-based sampling, Applied Soft Computing, vol.12, issue.9, pp.2828-2839, 2012.

C. Ran and Y. Jin, A competitive swarm optimizer for large scale optimization, IEEE Transactions on Cybernetics, vol.45, issue.2, pp.191-204, 2015.

B. Rangaswamy, A. S. Jain, and F. Glover, Tabu search candidate list strategies in scheduling, Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, Interfaces in Computer Science and Operations, pp.215-233, 1998.

M. Raschip, C. Croitoru, and K. Stoffel, Using association rules to guide evolutionary search in solving constraint satisfaction, Proceedings of Congress on Evolutionary Computation (CEC-2015), pp.744-750, 2015.

S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi, Heuristic and special case algorithms for dispersion problems, Operations Research, vol.42, issue.2, pp.299-310, 1994.

L. Santos, M. H. Ribeiro, A. Plastino, and S. L. Martins, A hybrid GRASP with data mining for the maximum diversity problem, Hybrid Metaheuristics, pp.116-127, 2005.

K. Sörensen and M. Sevaux, MA|PM: memetic algorithms with population management, Computers & Operations Research, vol.33, issue.5, pp.1214-1225, 2006.

H. R. Tizhoosh, Opposition-based learning: A new scheme for machine intelligence, Proceedings of International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA/IAWTIC-2005), pp.695-701, 2005.

M. Ventresca and H. R. Tizhoosh, A diversity maintaining population-based incremental learning algorithm, Information Sciences, vol.178, issue.21, pp.4038-4056, 2008.

J. Wang, Y. Zhou, Y. Cai, and J. Yin, Learnable tabu search guided by estimation of distribution for maximum diversity problems, Soft Computing, vol.16, issue.4, pp.711-728, 2012.

Y. Wang, J. K. Hao, F. Glover, and Z. Lü, A tabu search based memetic algorithm for the maximum diversity problem, Engineering Applications of Artificial Intelligence, vol.27, pp.103-114, 2014.

Q. Wu and J. K. Hao, A hybrid metaheuristic method for the maximum diversity problem, European Journal of Operational Research, vol.231, issue.2, pp.452-464, 2013.

Q. Xu, L. Wang, N. Wang, X. Hei, and L. Zhao, A review of oppositionbased learning from, Engineering Applications of Artificial Intelligence, vol.29, pp.1-12, 2005.

Y. Zhou, J. K. Hao, and B. Duval, Reinforcement learning based local search for grouping problems: A case study on graph coloring, Expert Systems with Applications, vol.64, pp.412-422, 2016.