]. A. Bcc-+-10, M. Bhaskara, E. Charikar, U. Chlamtac, A. Feige et al., Detecting high log-densities: an o(n 1/4 ) approximation for densest k-subgraph, Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC'10), pp.201-210, 2010.

]. A. Bcv-+-12, M. Bhaskara, A. Charikar, V. Vijayaraghavan, Y. Guruswami et al., Polynomial integrality gaps for strong sdp relaxations of densest k-subgraph, Proceedings of the Twenty- Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'12), pp.388-405, 2012.

S. [. Billionnet, M. Elloumi, and . Plateau, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Discrete Applied Mathematics, vol.157, issue.6, pp.1185-1197, 2009.
DOI : 10.1016/j.dam.2007.12.007
URL : https://hal.archives-ouvertes.fr/hal-01125253

]. A. Bil05 and . Billionnet, Different formulations for solving the heaviest ksubgraph problem, Information Systems and Operational Res, vol.43, issue.3, pp.171-186, 2005.

P. [. Byrd, J. Lu, C. Nocedal, and . Zhu, A Limited Memory Algorithm for Bound Constrained Optimization, SIAM Journal on Scientific Computing, vol.16, issue.5, pp.1190-1208, 1995.
DOI : 10.1137/0916069

]. B. Bor99 and . Borchers, CSDP, a C library for semidefinite programming, Optimization Methods and Software, vol.11, issue.1, pp.613-623, 1999.

[. Ben-tal and A. Nemirovski, Lectures on Modern Convex Optimization . MPS-SIAM Series on Optimization, 2001.

Y. [. Corneil and . Perl, Clustering and domination in perfect graphs, Discrete Applied Mathematics, vol.9, issue.1, pp.7-39, 1984.
DOI : 10.1016/0166-218X(84)90088-X

B. L. Cun and C. , BOB: A unified platform for implementing branch-and-bound like algorithms, 1995.

R. [. Crescenzi, L. Silvestri, and . Trevisan, On Weighted vs Unweighted Versions of Combinatorial Optimization Problems, Information and Computation, vol.167, issue.1, pp.10-26, 2001.
DOI : 10.1006/inco.2000.3011

]. E. Erk90 and . Erkut, The discrete p-dispersion problem, European Journal of Operational Research, vol.46, issue.1, pp.48-60, 1990.

U. Feige and M. Langberg, Approximation Algorithms for Maximization Problems Arising in Graph Partitioning, Journal of Algorithms, vol.41, issue.2, pp.174-211, 2001.
DOI : 10.1006/jagm.2001.1183

F. [. Faye and . Roupin, Partial Lagrangian for general quadratic programming. 4'OR, A, Quarterly Journal of Operations Research, vol.5, issue.1, pp.75-88, 2007.
DOI : 10.1007/s10288-006-0011-7
URL : https://hal.archives-ouvertes.fr/hal-01125184

]. S. Kho05 and . Khot, Ruling out PTAS for graph min-bisection, dense ksubgraph , and bipartite clique, SIAM J. Comput, vol.36, pp.1025-1071, 2005.

J. [. Krislock, F. Malick, and . Roupin, Improved semidefinite bounding procedure for solving Max-Cut problems to optimality, Mathematical Programming, pp.1-26, 2012.
DOI : 10.1007/s10107-012-0594-z
URL : https://hal.archives-ouvertes.fr/hal-00665968

J. Malick and F. Roupin, Solving $$k$$ -cluster problems to optimality with semidefinite programming, Mathematical Programming, vol.10, issue.4, pp.279-300, 2012.
DOI : 10.1007/s10107-012-0604-1
URL : https://hal.archives-ouvertes.fr/hal-00609744

J. Malick and F. Roupin, On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0???1 quadratic problems leading to quasi-Newton methods, Mathematical Programming, vol.3, issue.3, pp.99-124, 2013.
DOI : 10.1007/s10107-012-0628-6
URL : https://hal.archives-ouvertes.fr/hal-00662367

]. D. Pis06 and . Pisinger, Upper bounds and exact algorithms for p-dispersion problems, Computers and Operations Research, vol.33, pp.1380-1398, 2006.

F. [. Poljak, H. Rendl, and . Wolkowicz, A recipe for semidefinite relaxation for (0,1)-quadratic programming, Journal of Global Optimization, vol.40, issue.2, pp.51-73, 1995.
DOI : 10.1007/BF01100205

M. Ramana, L. Tunçel, and H. Wolkowicz, Strong Duality for Semidefinite Programming, SIAM Journal on Optimization, vol.7, issue.3, pp.641-662, 1997.
DOI : 10.1137/S1052623495288350
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.216