G. Best and G. , PM and other stateof-the-art algorithms on larger BQO instances, p.59

G. Best and G. , PM and other stateof-the-art algorithms on MaxCut instances, p.62

T. Comparison, MA and other state-of-the-art algorithms for Type1 22 instances, p.107

T. Comparison, MA and other state-of-the-art algorithms for ORLIB instances, p.107

T. Comparison, MA and other state-of-the-art algorithms for Palubeckis instances, p.107

T. Ma, I. Vns, and L. Tig, Wilcoxon's test at the 0, p.108

/. Ma and T. , MA using Wilcoxon's test (at the 0.05 level), p.114

Z. @bullet-yang-wang, F. Lü, J. Glover, and . Hao, Probabilistic GRASP- Tabu Search algorithms for the UBQP problem, Computers & Operations Research

Z. @bullet-yang-wang, F. Lü, J. Glover, and . Hao, Backbone guided tabu search for solving the UBQP problem problem, Journal of Heuristics

Y. Published-conference, Z. Wang, F. Lü, J. Glover, and . Hao, A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization, CPAIOR 2012, pp.395-408, 2012.

Z. @bullet-yang-wang, F. Lü, J. Glover, and . Hao, Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming

Z. @bullet-yang-wang, J. Lü, and . Hao, A Study of Multi-Parent Crossover Operator in a Memetic Algorithm, Lecture Notes in Computer Science, vol.6238, pp.556-565, 2010.

Y. Submitted-journal, J. Wang, F. Hao, Z. Glover, and . Lü, Solving the maximum clique and maximum vertex weight clique problems via binary quadratic programming, 2012.

E. H. Aarts, J. Korst, and P. V. Laarhoven, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem, Journal of Statistical Physics, vol.21, issue.1-2, pp.187-206, 1988.
DOI : 10.1007/BF01022991

G. Alidaee, A. Kochenberger, and . Ahmadian, 0-1 Quadratic programming approach for optimum solutions of two scheduling problems, International Journal of Systems Science, vol.17, issue.2, pp.401-408, 1994.
DOI : 10.1145/321921.321934

F. Alidaee, G. Glover, H. Kochenberger, and . Wang, Solving the maximum edge weight clique problem via unconstrained quadratic programming, European Journal of Operational Research, vol.181, issue.2, pp.592-597, 2007.
DOI : 10.1016/j.ejor.2006.06.035

G. Alidaee, K. Kochenberger, M. Lewis, H. Lewis, and . Wang, A new approach for modeling and solving set packing problems, European Journal of Operational Research, vol.186, issue.2, pp.504-512, 2008.
DOI : 10.1016/j.ejor.2006.12.068

M. Alkhamis, M. Hasan, and M. A. Ahmed, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, European Journal of Operational Research, vol.108, issue.3, pp.641-652, 1998.
DOI : 10.1016/S0377-2217(97)00130-6

M. M. Amini, B. Alidaee, and G. Kochenberger, A scatter search approach to unconstrained quadratic binary programs, New Ideas in Optimization, pp.317-329, 1999.

P. M. Andrade, A. Plastino, L. S. Ochi, and S. L. Martins, Grasp for the maximum diversity problem, Proceedings of the Fifth Metaheuristics International Conference (MIC2003), 2003. REFERENCES [Andrade et al, 2005.

M. R. Andrade, P. M. Andrade, S. L. Martins, and A. Plastino, Grasp with pathrelinking for the maximum diversity problem, Experimental and Efficient Algorithms, pp.558-569, 2005.

R. Aringhieri and R. Cordonearinghieri, Comparing local search metaheuristics for the maximum diversity problem, Journal of the Operational Research Society, vol.1, issue.1, pp.266-280, 2008.
DOI : 10.2307/3001968

R. Aringhieri, Y. Cordone, and . Melzani, Tabu Search versus GRASP for the maximum diversity problem, 4OR, vol.49, issue.1, pp.45-60, 1994.
DOI : 10.1007/s10288-007-0033-9

L. Babel, Ein schneller Algorithmus f??r das gewichtete Maximum Clique Problem, Computing, vol.38, issue.1, pp.31-38, 1994.
DOI : 10.1007/BF02243394

D. Ballard and C. Brown, Computer Vision, 1983.

E. Balus and C. Yu, Finding a Maximum Clique in an Arbitrary Graph, SIAM Journal on Computing, vol.15, issue.4, pp.1054-1068, 1986.
DOI : 10.1137/0215075

A. Bar-noy and G. Kortsarz, Minimum Color Sum of Bipartite Graphs, Journal of Algorithms, vol.28, issue.2, pp.339-365, 1998.
DOI : 10.1006/jagm.1998.0938

A. Bar-noy, M. Bellareb, M. M. Halldorsson, H. Shachnai, and T. Tamir, On Chromatic Sums and Distributed Resource Allocation, Information and Computation, vol.140, issue.2, pp.183-202, 1998.
DOI : 10.1006/inco.1997.2677

F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt, An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design, Operations Research, vol.36, issue.3, pp.493-513, 1988.
DOI : 10.1287/opre.36.3.493

F. Barahona, A solvable case of quadratic 0???1 programming, Discrete Applied Mathematics, vol.13, issue.1, pp.23-26, 1986.
DOI : 10.1016/0166-218X(86)90065-X

R. Battiti and F. Mascia, Reactive and dynamic local search for max-clique: Engineering effective building blocks, Computers & Operations Research, vol.37, issue.3, pp.534-542, 2010.
DOI : 10.1016/j.cor.2009.02.013

R. Battiti and M. Protasi, Reactive Local Search for the Maximum Clique Problem1, Algorithmica, vol.29, issue.4, pp.610-637, 2001.
DOI : 10.1007/s004530010074

J. E. Beasley, Obtaining test problems via Internet, Journal of Global Optimization, vol.8, issue.4, pp.429-433, 1996.
DOI : 10.1007/BF02404002

J. E. Beasley, Heuristic algorithms for the unconstrained binary quadratic programming problem, 1998.

U. Benlic and J. K. Hao, A Multilevel Memetic Approach for Improving Graph k-Partitions, IEEE Transactions on Evolutionary Computation, vol.15, issue.5, pp.624-642, 2011.
DOI : 10.1109/TEVC.2011.2136346

A. Billionnet and S. Elloumi, Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem, Mathematical Programming, vol.236, issue.1, pp.55-68, 2007.
DOI : 10.1007/s10107-005-0637-9
URL : https://hal.archives-ouvertes.fr/hal-01125239

A. Billionnet and A. Sutter, Minimization of a quadratic pseudo-Boolean function, European Journal of Operational Research, vol.78, issue.1, pp.106-115, 1994.
DOI : 10.1016/0377-2217(94)90125-2
URL : https://hal.archives-ouvertes.fr/hal-01124495

M. Bomze, M. Pelillo, and V. Stix, Approximating the maximum weight clique using replicator dynamics, IEEE Transactions on Neural Networks, vol.11, pp.1228-1241, 2000.

F. Bonomo, G. Duran, J. Marenco, and M. V. Pabon, Minimum sum set coloring of trees and line graphs of trees, Discrete Applied Mathematics, vol.159, issue.5, pp.288-294, 2011.
DOI : 10.1016/j.dam.2010.11.018

E. Boros, P. L. Hammer, and X. Sun, The ddt method for quadratic 0-1 minimization

E. Boros, P. L. Hammer, and G. Tavares, Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO), Journal of Heuristics, vol.13, issue.2, pp.99-132, 2007.
DOI : 10.1007/s10732-007-9009-3

H. Bouziri and M. Jouini, A tabu search approach for the sum coloring problem, Electronic Notes in Discrete Mathematics, vol.36, issue.1, pp.915-922, 2010.
DOI : 10.1016/j.endm.2010.05.116

D. Uro?sevi´curo?sevi´uro?sevi´c, E. Ngai, J. Brimberg, and N. Mladenovi´cmladenovi´c, Variable neighborhood search for the heaviest-subgraph, Computers & Operations Research REFERENCES [Burer et al, vol.36, issue.83, pp.2885-2891, 2001.

S. Burer, R. D. Monteiro, and Y. Zhang, Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs, SIAM Journal on Optimization, vol.12, issue.2, pp.503-521, 2001.
DOI : 10.1137/S1052623400382467

S. Busygin, A new trust region technique for the maximum weight clique problem, Discrete Applied Mathematics, vol.154, issue.15
DOI : 10.1016/j.dam.2005.04.010

J. Cai, J. Wang, Y. Yin, and . Zhou, Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems, Expert Systems with Applications, vol.38, issue.6, pp.7817-7827, 2011.
DOI : 10.1016/j.eswa.2010.12.124

P. Chardaire and A. Sutter, A Decomposition Method for Quadratic Zero-One Programming, Management Science, vol.41, issue.4, pp.704-712, 1994.
DOI : 10.1287/mnsc.41.4.704

C. Choi and Y. Ye, Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver, 2000.

M. Douiri and S. Elbernoussi, New algorithm for the sum coloring problem, International Journal of Contemporary Mathematical Sciences, vol.6, issue.10, pp.453-463, 2011.

A. Duarte and R. Marti, Tabu search and GRASP for the maximum diversity problem, European Journal of Operational Research, vol.178, issue.1, pp.71-84, 2007.
DOI : 10.1016/j.ejor.2006.01.021

P. Festa, P. M. Pardalos, M. G. Resende, and C. C. Ribeiro, Randomized heuristics for the Max-Cut problem, Optimization Methods and Software, vol.25, issue.6, pp.1033-1058, 2002.
DOI : 10.1080/1055678021000090033

M. Gallego, A. Duarte, M. Laguna, and R. Martí, Hybrid heuristics for the maximum diversity problem, Computational Optimization and Applications, vol.33, issue.6, pp.36-44, 2009.
DOI : 10.1007/s10589-007-9161-6

G. Gallo, P. L. Hammer, and B. Simeone, Quadratic knapsack problems, Mathematical Programming Studies, vol.12, pp.132-149, 1980.
DOI : 10.1007/BFb0120892

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-Completeness, W. H. Freeman and Company, 1979.

X. T. Geng, J. Xu, J. H. Xiao, and L. Q. Pan, A simple simulated annealing algorithm for the maximum clique problem, Information Sciences, vol.177, issue.22, pp.5064-5071, 1996.
DOI : 10.1016/j.ins.2007.06.009

J. B. Ghosh, Computational aspects of the maximum diversity problem, Operations Research Letters, vol.19, issue.4, pp.175-181, 1996.
DOI : 10.1016/0167-6377(96)00025-9

F. Glover and J. K. Hao, Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems, International Journal of Metaheuristics, vol.1, issue.1, pp.3-10, 2010.
DOI : 10.1504/IJMHEUR.2010.033120

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

F. Glover and R. E. Woolsey, Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems, Operations Research, vol.21, issue.1, pp.156-161, 1973.
DOI : 10.1287/opre.21.1.156

F. Glover and R. E. Woolsey, Technical Note???Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program, Operations Research, vol.22, issue.1, pp.180-181, 1974.
DOI : 10.1287/opre.22.1.180

G. Glover, B. Kochenberge, and . Alidaee, Adaptive Memory Tabu Search for Binary Quadratic Programs, Management Science, vol.44, issue.3, pp.336-345, 1998.
DOI : 10.1287/mnsc.44.3.336

M. Glover, R. Laguna, and . Marti, Fundamentals of scatter search and path-relinking, Control and Cybernetics, vol.39, pp.654-684, 2000.

C. Glover, B. Rego, G. Alidaee, and . Kochenberge, One-pass heuristics for large-scale unconstrained binary quadratic problems, European Journal of Operational Research, vol.137, issue.2, pp.272-287, 2002.
DOI : 10.1016/S0377-2217(01)00209-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.194.8169

M. Glover, R. Laguna, and . Marti, Scatter search and path relinking: advances and applications. Handbook of Metaheuristics, pp.1-35, 2003.

M. Glover, R. Laguna, and . Marti, Scatter Search and Path Relinking: Foundations and Advanced Designs, New Optimization Technologies in Engineering, vol.141, pp.87-100, 2004.
DOI : 10.1007/978-3-540-39930-8_4

Z. Glover, J. K. Lü, and . Hao, Diversification-driven tabu search for unconstrained binary quadratic problems, 4OR, vol.4, issue.2, pp.239-253, 1977.
DOI : 10.1007/s10288-009-0115-y

. Glover, HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS, Decision Sciences, vol.15, issue.1, pp.156-166, 1977.
DOI : 10.1093/comjnl/16.2.135

. Glover, Tabu Search???Part I, ORSA Journal on Computing, vol.1, issue.3, pp.190-206, 1989.
DOI : 10.1287/ijoc.1.3.190

. Glover, Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), Discrete Applied Mathematics, vol.49, issue.1-3, pp.231-255, 1994.
DOI : 10.1016/0166-218X(94)90211-9

. Glover, Adaptive Memory Projection Methods for Integer Programming, Metaheuristic Optimization Via Memory and Evolution, pp.425-440, 2005.
DOI : 10.1007/0-387-23667-8_19

A. Grosso, M. Locatelli, and W. Pullan, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Journal of Heuristics, vol.21, issue.5, pp.587-612, 2000.
DOI : 10.1007/s10732-007-9055-x

H. Hajiabolhassan, M. L. Mebrabadi, and R. Tusserkani, Minimal coloring and strength of graphs, Discrete Mathematics, vol.215, issue.1-3, pp.265-270, 2000.
DOI : 10.1016/S0012-365X(99)00319-2

A. R. Hanafi, M. Rebai, and . Vasquez, Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems, Journal of Heuristics, vol.5, issue.3, 2011.
DOI : 10.1007/s10732-011-9169-z
URL : https://hal.archives-ouvertes.fr/hal-00814716

P. Hansen and N. Mladenovi´cmladenovi´c, Variable neighborhood search, Handbook of Metaheuristics of International Series in Operations Research Management Science, pp.145-184, 2003.
DOI : 10.1007/978-0-387-74759-0_694
URL : https://hal.archives-ouvertes.fr/hal-00979295

B. Hansen, C. Jaumard, and . Meyer, A simple enumerative algorithm for unconstrained 0-1 quadratic programming, 2000.

J. K. Hao, Memetic Algorithms in Discrete Optimization, Handbook of Memetic Algorithms, pp.73-94, 2011.
DOI : 10.1007/978-3-642-23247-3_6

F. Harary, On the notion of balanced of a signed graph, pp.143-146, 1953.

A. Helmar and M. Chiarandini, A local search heuristic for chromatic sum, MIC2011: The IX Metaheuristic International Conference, 2011.

C. Helmberg and F. , Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Mathematical Programming, pp.388-399, 1998.
DOI : 10.1007/BF01580072

. Jansen, Approximation Results for the Optimum Cost Chromatic Partition Problem, Journal of Algorithms, vol.34, issue.1, pp.54-89, 2000.
DOI : 10.1006/jagm.1999.1022

S. Jha and P. M. Pardalos, Graph separation techniques for quadratic zero-one programming, 1987.

X. Ji, G. D. Xu, and . Stormo, A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences, Bioinformatics, vol.20, issue.10, pp.1591-1602, 2004.
DOI : 10.1093/bioinformatics/bth131

T. Jones and S. Forrest, Fitness distance correlation as a measure of problem difficulty for genetic algorithms, Proceedings of the 6th International Conference on Genetic Algorithms, pp.184-192, 1995.

K. Katayama and H. Narihisa, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, European Journal of Operational Research, vol.134, issue.1, pp.103-119, 2001.
DOI : 10.1016/S0377-2217(00)00242-3

K. Katayama and H. Narihisa, An Evolutionary Approach for the Maximum Diversity Problem, Recent advances in memetic algorithms, pp.31-47, 2004.
DOI : 10.1007/3-540-32363-5_2

K. Katayama, M. Tani, and H. Narihisa, Solving large binary quadratic programming problems by effective genetic local search algorithm, Proceedings of the 2000 Genetic and Evolutionary Computation Conference, pp.643-650, 2000.

K. Katayama, A. Hamamoto, and H. Narihisa, An effective local search for the maximum clique problem, Information Processing Letters, vol.95, issue.5, pp.503-511, 2005.
DOI : 10.1016/j.ipl.2005.05.010

P. Kilby, J. Slaney, S. Thiébaux, and T. Walsh, Backbones and backdoors in satisfiablity, Proceedings of AAAI-2005, pp.1368-1373, 2001.

S. Knot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, Proceedings of 42nd annual IEEE symposium on fundations of computer science (FOCS), pp.600-609, 2001.

G. Kochenberger, F. Glover, B. Alidaee, and C. Rego, A unified modeling and solution framework for combinatorial optimization problems, OR Spectrum, vol.26, issue.2, pp.237-250, 2004.
DOI : 10.1007/s00291-003-0153-3

G. Kochenberger, F. Glover, B. Alidaee, and C. Rego, An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem, Annals of Operations Research, vol.4, issue.1???3, pp.229-241, 2005.
DOI : 10.1007/s10479-005-3449-7

G. Kochenberger, B. Alidaee, F. Glover, and H. Wang, An effective modeling and solution approach for the generalized independent set problem, Optimization Letters, vol.45, issue.1 & 2, pp.111-117, 2007.
DOI : 10.1007/s11590-006-0007-4

G. Kochenberger, J. K. Hao, Z. Lü, H. Wang, and F. Glover, Solving large scale Max Cut problems via tabu search, Journal of Heuristics, vol.121, issue.4, 2011.
DOI : 10.1007/s10732-011-9189-8

Z. Kokosinski and K. Kawarciany, On Sum Coloring of Graphs with Parallel Genetic Algorithms, In Lecture Notes in Computer Science, vol.4431, pp.211-219, 2007.
DOI : 10.1007/978-3-540-71618-1_24

J. Krarup and A. Pruzan, Computer-aided layout design, Mathematical Programming Study, vol.9, pp.75-94, 1978.
DOI : 10.1007/BFb0120827

L. G. Kroon, A. Sen, H. Deng, and A. Roy, The Optimal Cost Chromatic Partition problem for trees and interval graphs, Lecture Notes in Computer Science, vol.1197, pp.279-292, 1996.
DOI : 10.1007/3-540-62559-3_23

E. Kubicka and A. J. Schwenk, An introduction to chromatic sums, Proceedings of the seventeenth annual ACM conference on Computer science : Computing trends in the 1990's Computing trends in the 1990's, CSC '89, pp.39-45, 1989.
DOI : 10.1145/75427.75430

C. C. Kuo, F. Glover, and K. S. Dhir, Analyzing and Modeling the Maximum Diversity Problem by Zero-One Programming, Decision Sciences, vol.1, issue.3, pp.1171-1185, 1993.
DOI : 10.2307/256281

D. J. Laughunn, Quadratic Binary Programming with Application to Capital-Budgeting Problems, Operations Research, vol.18, issue.3, pp.454-461, 1970.
DOI : 10.1287/opre.18.3.454

M. Lewis, G. Kochenberger, and B. Alidaee, A new modeling and solution approach for the set-partitioning problem, Computers & Operations Research, vol.35, issue.3, pp.807-813, 2008.
DOI : 10.1016/j.cor.2006.04.002

M. Lewis, B. Alidaee, F. Glover, and G. Kochenberger, A note on xQx as a modelling and solution framework for the Linear Ordering Problem, International Journal of Operational Research, vol.5, issue.2, pp.152-162, 2009.
DOI : 10.1504/IJOR.2009.025005

C. Li, A. Lucet, K. Moukrim, and . Sghiouer, Greedy algorithms for the minimum sum coloring problem, Proceedings LT2009 Conference, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00451266

W. Liu, D. Wilkins, and B. Alidaee, A hybrid multi-exchange local search for unconstrained binary quadratic program. Working papers series, Hearin center for enterprise science, 2006.

A. Lodi, K. Allemand, and T. M. Liebling, An evolutionary heuristic for quadratic 0???1 programming, European Journal of Operational Research, vol.119, issue.3, pp.662-670, 1999.
DOI : 10.1016/S0377-2217(98)00359-2

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.
DOI : 10.1016/j.ejor.2011.04.018

Z. Lü, F. Glover, and J. K. Hao, A hybrid metaheuristic approach to solving the UBQP problem, European Journal of Operational Research, vol.207, issue.3, pp.1254-1262, 2010.
DOI : 10.1016/j.ejor.2010.06.039

Z. Lü, J. K. Hao, and F. Glover, A study of memetic search with multi-parent combination for ubqp, Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization, pp.154-165, 2010.

Z. Lü, F. Glover, and J. K. Hao, Neighborhood combination for unconstrained binary quadratic problems, MIC-2009 Post-Conference Book, pp.49-61, 2012.

M. Malafiejski, Sum coloring of graphs, Graph Colorings, Contemporary Mathematics REFERENCES [Manninno and Stefanutti, pp.55-65, 1999.
DOI : 10.1090/conm/352/06372

C. Manninno and E. Stefanutti, An augmentation algorithm for the maximum weighted stable set problem, Computational Optimization and Applications, vol.14, issue.3, pp.367-381, 1999.
DOI : 10.1023/A:1026456624746

A. Marti, M. Duarte, and . Laguna, Advanced Scatter Search for the Max-Cut Problem, INFORMS Journal on Computing, vol.21, issue.1, pp.26-38, 2009.
DOI : 10.1287/ijoc.1080.0275

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.
DOI : 10.1016/j.ejor.2008.12.023

R. Martí, G. Micael, D. Abraham, and G. P. Eduardo, Heuristics and metaheuristics for the maximum diversity problem, Journal of Heuristics, vol.39, issue.4, 2011.
DOI : 10.1007/s10732-011-9172-4

G. R. Mauri and L. A. Lorena, Lagrangean decompositions for the unconstrained binary quadratic programming problem, International Transactions in Operational Research, vol.4, issue.2, pp.257-270, 2011.
DOI : 10.1111/j.1475-3995.2009.00743.x

G. R. Mauri and L. A. Lorena, A column generation approach for the unconstrained binary quadratic programming problem, European Journal of Operational Research, vol.217, issue.1, pp.69-74, 2012.
DOI : 10.1016/j.ejor.2011.09.016

R. D. Mcbride and J. S. Yormark, An Implicit Enumeration Algorithm for Quadratic Integer Programming, Management Science, vol.26, issue.3, pp.282-296, 1980.
DOI : 10.1287/mnsc.26.3.282

P. Merz and B. Freisleben, Genetic algorithms for binary quadratic programming, Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pp.417-424, 1999.

P. Merz and B. Freisleben, Greedy and local search heuristics for unconstrained binary quadratic programming, Journal of Heuristics, vol.8, issue.2, pp.197-213, 2002.
DOI : 10.1023/A:1017912624016

P. Merz and K. Katayama, Memetic algorithms for the unconstrained binary quadratic programming problem, Biosystems, vol.78, issue.1-3, pp.99-118, 2004.
DOI : 10.1016/j.biosystems.2004.08.002

B. Meyerhenke, T. Monien, and . Sauerwald, A new diffusion-based multilevel algorithm for computing graph partitions of very high quality, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.750-761, 2009.
DOI : 10.1109/IPDPS.2008.4536237

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity for characteristic 'phase transitions, Nature, vol.400, pp.133-137, 1998.

F. Neri, C. Cotta, and P. Moscato, Handbook of Memetic Algorithms, Studies in Computational Intelligence, vol.379, p.53, 2001.
DOI : 10.1007/978-3-642-23247-3

P. R. Ostergård, A New Algorithm for the Maximum-Weight Clique Problem, Electronic Notes in Discrete Mathematics, vol.3, issue.4, pp.424-436, 2001.
DOI : 10.1016/S1571-0653(05)00757-2

M. Pajouh, B. Balasumdaram, and O. Prokopyev, On characterization of maximal independent sets via quadratic optimization, Journal of Heuristics, 2011.

G. Palubeckis and A. Tomkevicius, Grasp implementations for the unconstrained binary quadratic optimization problem, Information Technology and Control, vol.24, pp.14-20, 2002.

G. Palubeckis, Ein auf Heuristiken fu??endes Branch- and Bound-Verfahren zur quadratischen 0???1 Optimierung, Computing, vol.45, issue.4, pp.283-301, 1995.
DOI : 10.1007/BF02238228

G. Palubeckis, Application of multistart tabu search to the maxcut problem, Information Technology and Control, vol.2, pp.29-35, 2004.

G. Palubeckis, Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem, Annals of Operations Research, vol.131, issue.1-4, pp.259-282, 2004.
DOI : 10.1023/B:ANOR.0000039522.58036.68

G. Palubeckis, Iterated tabu search for the unconstrained binary quadratic optimization problem, Informatica, vol.17, pp.279-296, 2006.

G. Palubeckis, Iterated tabu search for the maximum diversity problem, Applied Mathematics and Computation, vol.189, issue.1, pp.371-383, 2007.
DOI : 10.1016/j.amc.2006.11.090

M. Pardalos and S. Jha, Complexity of uniqueness and local search in quadratic 0???1 programming, Operations Research Letters, vol.11, issue.2, pp.119-123, 1992.
DOI : 10.1016/0167-6377(92)90043-3

P. M. Pardalos, Rechnerische Aspekte eines ???Branch and Bound???-Algorithmus zur quadratischen Null-Eins-Programmierung, REFERENCES [Phillips and Rosen, pp.131-144, 1990.
DOI : 10.1007/BF02247879

A. T. Phillips and J. B. Rosen, A quadratic assignment formulation of the molecular conformation problem, Journal of Global Optimization, vol.2, issue.2, pp.229-241, 1994.
DOI : 10.1007/BF01096724

J. C. Picard, Minimum cuts and related problems, Networks, vol.17, issue.4, pp.357-370, 1974.
DOI : 10.1002/net.3230050405

W. Pullan and H. H. Hoos, Dynamic local search for the maximum clique problem, Journal of Artificial Intelligence Research, vol.25, pp.159-185, 2006.

W. Pullan, Phased local search for the maximum clique problem, Journal of Combinatorial Optimization, vol.1, issue.10, pp.303-323, 2006.
DOI : 10.1007/s10878-006-9635-y

W. Pullan, Approximating the maximum vertex/edge weighted clique using local search, Journal of Heuristics, vol.25, issue.10, pp.117-134, 2008.
DOI : 10.1007/s10732-007-9026-2

F. Rendl, G. Rinaldi, and A. Wiegele, A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations, 2006.
DOI : 10.1007/978-3-540-72792-7_23

M. Resendel and C. Ribeiro, GRASP with Path-Relinking: Recent Advances and Applications, Metaheuristics: Progress as Real Problem Solvers, pp.29-63, 2005.
DOI : 10.1007/0-387-25383-1_2

M. R. Salavatipour, On sum coloring of graphs, Discrete Applied Mathematics, vol.127, issue.3, pp.477-488, 2003.
DOI : 10.1016/S0166-218X(02)00249-4

N. S. Sengor, Y. Cakir, C. Guzelis, F. Pekergin, and O. Morgul, An analysis of maximum clique formulations and saturated linear dynamical network, ARI -An International Journal for Physical and Engineering Sciences, vol.51, pp.268-276, 1999.

V. P. Shylo and O. V. Shylo, Solving the maxcut problem by the global equilibrium search, Cybernetics and Systems Analysis, vol.10, issue.1, pp.744-754, 2010.
DOI : 10.1007/s10559-010-9256-4

V. P. Shylo and O. V. Shylo, Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search, Cybernetics and Systems Analysis, vol.35, issue.1, pp.889-897, 2011.
DOI : 10.1007/s10559-011-9368-5

G. C. Silva, L. S. Ochi, and S. L. Martins, Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem, Proceedings of the 3rd International Conference on Genetic Algorithms, pp.498-512, 2004.
DOI : 10.1007/978-3-540-24838-5_37

G. C. Silva, M. R. Andrade, L. S. Ochi, S. L. Martins, and A. Plastino, New heuristics for the maximum diversity problem, Journal of Heuristics, vol.49, issue.4, pp.315-336, 2007.
DOI : 10.1007/s10732-007-9010-x

A. Singh and A. K. Gupta, A hybrid heuristic for the maximum clique problem, Journal of Heuristics, vol.24, issue.5, pp.5-22, 2006.
DOI : 10.1007/s10732-006-3750-x

C. Solnon and S. Fenet, A study of ACO capabilities for solving the maximum clique problem, Journal of Heuristics, vol.6, issue.4, pp.155-180, 2005.
DOI : 10.1007/s10732-006-4295-8

G. Syswerda, Uniform crossover in genetic algorithms, Proceedings of the 3rd International Conference on Genetic Algorithms, pp.2-9, 1989.

C. Thomassen, P. Erdos, Y. Alavi, and P. J. Malde, Tight bounds on the chromatic sum of a connected graph, Journal of Graph Theory, vol.13, issue.3, pp.353-357, 1989.
DOI : 10.1002/jgt.3190130310

M. Toulouse, K. Thulasiraman, and F. Glover, Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning, Euro-Par' 99 Parallel Processing, pp.533-542, 1999.
DOI : 10.1007/3-540-48311-X_75

C. Walshaw and M. Cross, Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm, SIAM Journal on Scientific Computing, vol.22, issue.1, pp.63-80, 2000.
DOI : 10.1137/S1064827598337373

C. Walshaw, Multilevel Refinement for Combinatorial Optimisation Problems, Annals of Operations Research, vol.131, issue.1-4, pp.325-372, 2004.
DOI : 10.1023/B:ANOR.0000039525.80601.15

J. Wang, Y. Zhou, and J. Yin, Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem, Expert System with Applications, 2011.
DOI : 10.1016/j.eswa.2011.05.060

Y. Wang, Z. Lü, F. Glover, and J. K. Hao, Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming, Lecture Notes in Computer Science, vol.6622, pp.72-83, 2011.
DOI : 10.1007/978-3-642-20364-0_7

J. Wang, Y. Zhou, Y. Cai, and J. Yin, Learnable tabu search guided by estimation of distribution for maximum diversity problems. Soft Computing -A Fusion of Foundations, Methodologies and Applications, pp.711-728, 2012.

Y. Wang, J. K. Hao, F. Glover, and Z. Lü, Solving the maximum vertex weight clique problem via binary quadratic programming, Journal of Combinatorial Optimization, vol.1, issue.1, 2012.
DOI : 10.1007/s10878-016-9990-2
URL : https://hal.archives-ouvertes.fr/hal-01412535

Y. Wang, J. K. Hao, F. Glover, and Z. Lü, Solving the minimum sum coloring problem via binary quadratic programming, 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, 2012.
DOI : 10.1016/j.engappai.2013.09.005

Y. Wang, Z. Lü, F. Glover, and J. K. Hao, A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization, CPAIOR 2012, pp.395-408, 2012.
DOI : 10.1007/978-3-642-29828-8_26

Y. Wang, Z. Lü, F. Glover, and J. K. Hao, Path relinking for unconstrained binary quadratic programming, European Journal of Operational Research, vol.223, issue.3, pp.595-604, 2012.
DOI : 10.1016/j.ejor.2012.07.012

Y. Wang, Z. Lü, F. Glover, and J. K. Hao, Probabilistic GRASP-Tabu Search algorithms for the UBQP problem, Computers & Operations Research, vol.40, issue.12, 2012.
DOI : 10.1016/j.cor.2011.12.006

C. Wilbaut, S. Salhi, and S. Hanafi, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, European Journal of Operational Research, vol.199, issue.2, pp.339-348, 2009.
DOI : 10.1016/j.ejor.2008.11.036

Q. Wu and J. K. Hao, An adaptive multistart tabu search approach to solve the maximum clique problem, Journal of Combinatorial Optimization, vol.39, issue.7, 2011.
DOI : 10.1007/s10878-011-9437-8

Q. Wu and J. K. Hao, An effective heuristic algorithm for sum coloring of graphs, Computers & Operations Research, vol.39, issue.7, pp.1593-1600, 2012.
DOI : 10.1016/j.cor.2011.09.010

J. F. Xu, S. Y. Chiu, and F. Glover, Probabilistic tabu search for telecommunications network design, Combinational Optimization: Theory and Practice, vol.1, pp.69-94, 1996.

J. F. Xu, S. Y. Chiu, and F. Glover, Fine-tuning a Tabu Search Algorithm with Statistical Tests, International Transactions in Operational Research, vol.1, issue.1, pp.233-244, 1998.
DOI : 10.1007/BF02109861

W. Zhang, Configuration landscape analysis and backbone guided local search., Artificial Intelligence, vol.158, issue.1, pp.1-26, 2004.
DOI : 10.1016/j.artint.2004.04.001