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

F. Harary, On the notion of balance of a signed graph., The Michigan Mathematical Journal, vol.2, issue.2, pp.143-146, 1953.
DOI : 10.1307/mmj/1028989917

J. Krarup and P. M. Pruzan, Computer-aided layout design, Mathematical Programming in Use Mathematical Programming Studies, vol.9, issue.6, pp.75-94, 1978.
DOI : 10.1007/BFb0120827

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

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

M. Lewis, G. Kochenberger, and B. , 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. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

E. Boros, P. L. Hammer, R. Sun, and G. Tavares, A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO), Discrete Optimization, vol.5, issue.2, pp.501-529, 2008.
DOI : 10.1016/j.disopt.2007.02.001

C. Helmberg and F. , Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Mathematical Programming, vol.62, issue.115, pp.291-315, 1998.
DOI : 10.1007/BF01580072

P. M. Pardalos and G. P. Rodgers, Rechnerische Aspekte eines ???Branch and Bound???-Algorithmus zur quadratischen Null-Eins-Programmierung, Computing, vol.5, issue.3, pp.131-144, 1990.
DOI : 10.1007/BF02247879

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

F. Glover, G. A. Kochenberger, and B. 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

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

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

Y. Wang, Z. Lü, F. Glover, and J. Hao, Backbone guided tabu search for solving the UBQP problem, Journal of Heuristics, vol.158, issue.2, pp.679-695, 2013.
DOI : 10.1007/s10732-011-9164-4

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

Y. Wang, Z. Lü, F. Glover, and J. 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

I. Borgulya, An Evolutionary Algorithm for the Unconstrained Binary Quadratic Problems, of Advances in Soft Computing, pp.3-16, 2005.
DOI : 10.1007/3-540-31182-3_1

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

Z. Lü, F. Glover, and J. 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

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

Y. Wang, Z. Lü, F. Glover, and J. Hao, Solving the minimum sum coloring problem via binary quadratic programming

P. Serafini, Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems, Lecture Notes in Economics and Mathematical Systems, vol.294, pp.222-232, 1987.
DOI : 10.1007/978-3-642-46618-2_15

M. Ehrgott, Multicriteria optimization, 2005.
DOI : 10.1007/978-3-662-22199-0

E. Zitzler, L. Thiele, M. Laumanns, C. M. Foneseca, V. Grunert et al., Performance assessment of multiobjective optimizers: an analysis and review, IEEE Transactions on Evolutionary Computation, vol.7, issue.2, pp.117-132, 2003.
DOI : 10.1109/TEVC.2003.810758

J. Knowles, L. Thiele, and E. Zitzler, A tutorial on the performance assessment of stochastic multiobjective optimizers, TIK Report, vol.214, 2006.

C. A. Coello-coello, G. B. Lamont, and D. A. , Van Veldhuizen, Evolutionary Algorithms for Solving Multi-Objective Problems, 2007.

M. Ehrgott and X. Gandibleux, Multiobjective Combinatorial Optimization ??? Theory, Methodology, and Applications, of International Series in Operations Research & Management Science, pp.369-444, 2003.
DOI : 10.1007/0-306-48107-3_8

C. Bazgan, H. Hugot, and D. Vanderpooten, Solving efficiently the 0???1 multi-objective knapsack problem, Computers & Operations Research, vol.36, issue.1, pp.260-279, 2009.
DOI : 10.1016/j.cor.2007.09.009

R. Kumar and P. Singh, Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms, Applied Soft Computing, vol.10, issue.3, pp.711-718, 2010.
DOI : 10.1016/j.asoc.2009.08.037

E. Angel, E. Bampis, and L. Gourvès, Approximation algorithms for the bi-criteria weighted MAX-CUT problem, Discrete Applied Mathematics, vol.154, issue.12, pp.1685-1692, 2006.
DOI : 10.1016/j.dam.2006.02.008
URL : https://hal.archives-ouvertes.fr/hal-00341348

J. Knowles and D. Corne, Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem, 2nd International Conference on Evolutionary Multi-Criterion Optimization (EMO 2003), pp.295-310, 2003.
DOI : 10.1007/3-540-36970-8_21

L. Paquete and T. Stützle, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, European Journal of Operational Research, vol.169, issue.3, pp.943-959, 2006.
DOI : 10.1016/j.ejor.2004.08.024

J. E. Beasley, OR-Library: Distributing Test Problems by Electronic Mail, Journal of the Operational Research Society, vol.41, issue.11, pp.1069-1072, 1990.
DOI : 10.1057/jors.1990.166

S. Verel, A. Liefooghe, L. Jourdan, and C. Dhaenens, On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives, European Journal of Operational Research, vol.227, issue.2, pp.331-342, 2013.
DOI : 10.1016/j.ejor.2012.12.019
URL : https://hal.archives-ouvertes.fr/hal-00760097

C. Blum, J. Puchinger, G. R. Raidl, and A. Roli, Hybrid metaheuristics in combinatorial optimization: A survey, Applied Soft Computing, vol.11, issue.6, pp.4135-4151, 2011.
DOI : 10.1016/j.asoc.2011.02.032
URL : https://hal.archives-ouvertes.fr/hal-01224683

J. Hao, Memetic Algorithms in Discrete Optimization, Studies in Computational Intelligence, vol.379, issue.6, pp.73-94, 2012.
DOI : 10.1007/978-3-642-23247-3_6

J. Knowles and D. Corne, Memetic algorithms for multiobjective optimization: Issues, methods and prospects, in: Recent Advances in Memetic Algorithms, of Studies in Fuzziness and Soft Computing, pp.313-352, 2005.

P. Chitra, R. Rajaram, and P. Venkatesh, Application and comparison of hybrid evolutionary multiobjective optimization algorithms for solving task scheduling problem on heterogeneous systems, Applied Soft Computing, vol.11, issue.2, pp.2725-2734, 2011.
DOI : 10.1016/j.asoc.2010.11.003

A. Wierzbicki, The Use of Reference Objectives in Multiobjective Optimization, Lecture Notes in Economics and Mathematical Systems, vol.177, pp.468-486, 1980.
DOI : 10.1007/978-3-642-48782-8_32

R. E. Steuer, Multiple Criteria Optimization: Theory, Computation and Application, 1986.

M. Szczepa´nskiszczepa´nski and A. Wierzbicki, Application of multiple criteria evolutionary algorithms to vector optimisation, decision support and reference point approaches, Journal of Telecommunications and Information Technology, vol.3, pp.16-33, 2003.

L. Thiele, K. Miettinen, P. J. Korhonen, and J. Molina, A Preference-Based Evolutionary Algorithm for Multi-Objective Optimization, Evolutionary Computation, vol.17, issue.3, pp.411-436, 2009.
DOI : 10.1162/106365600568202

J. R. Figueira, A. Liefooghe, E. Talbi, and A. P. Wierzbicki, A parallel multiple reference point approach for multi-objective optimization, European Journal of Operational Research, vol.205, issue.2, pp.390-400, 2010.
DOI : 10.1016/j.ejor.2009.12.027
URL : https://hal.archives-ouvertes.fr/hal-00522619

F. Glover and J. 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

K. Deb, S. Agrawal, A. Pratap, 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.
DOI : 10.1109/4235.996017

J. Humeau, A. Liefooghe, E. Talbi, S. Verel, and . Paradiseo-mo, From fitness landscape analysis to efficient local search algorithms, Journal of Heuristics, pp.10-1007
URL : https://hal.archives-ouvertes.fr/hal-00832029

A. Liefooghe, L. Jourdan, and E. Talbi, A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO, European Journal of Operational Research, vol.209, issue.2, pp.104-112, 2011.
DOI : 10.1016/j.ejor.2010.07.023
URL : https://hal.archives-ouvertes.fr/hal-00522612

S. Verel, A. Liefooghe, and C. Dhaenens, Set-based multiobjective fitness landscapes, Proceedings of the 13th annual conference on Genetic and evolutionary computation, GECCO '11, pp.769-776, 2011.
DOI : 10.1145/2001576.2001681
URL : https://hal.archives-ouvertes.fr/hal-00460442