J. [. Anjos, . [. Lasserre, S. Billionnet, and . Elloumi, Handbook of semidefinite, conic and polynomial optimization Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem, Mathematical Programming, vol.109, issue.1, pp.55-68, 2007.

A. Billionnet, S. Elloumi, and M. 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

J. F. Bonnans, J. Ch, C. Gilbert, C. Lemaréchal, ]. Sagastizábalbil05 et al., Numerical Optimization Different formulations for solving the heaviest k-subgraph problem CSDP, a C library for semidefinite programming Convex optimization, Information Systems and Operational Res. Optimization Methods and Software, vol.43, issue.111, pp.171-186613, 1999.

E. De-klerk and R. Sotirov, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem, Math. Prog, vol.122, issue.2, p.2010

A. Faye and F. Roupin, Partial lagrangian for general quadratic programming Some numerical experiments with variable-storage quasi- Newton algorithms, Mathematical Programming, pp.75-88407, 1989.

M. Goemans, D. Williamson, T. Habilitationsschrift, and . Berlin, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming [Hel00] C. Helmberg. Semidefinite Programming for Combinatorial Optimization, Helmberg. A C++ implementation of the Spectral Bundle Method Version 1.1.3. [Hig88] N. Higham. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra and its Applications, pp.1115-1145103, 1988.

C. Helmberg, S. Poljak, F. Rendl, and H. Wolkowicz, Combining semidefinite and polyhedral relaxations for integer programs, Lecture Notes in Computer Science SIAM Journal on Optimization, vol.920, issue.103, pp.124-134673, 1995.
DOI : 10.1007/3-540-59408-6_46
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.2861

C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz, An Interior-Point Method for Semidefinite Programming, SIAM Journal on Optimization, vol.6, issue.2, pp.342-361, 1996.
DOI : 10.1137/0806020

J. Hiriart-urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, 1993.
DOI : 10.1007/978-3-662-02796-7

S. Kim, M. Kojima, and H. Waki, Exploiting Sparsity in SDP Relaxation for Sensor Network Localization, SIAM Journal on Optimization, vol.20, issue.1, pp.192-215, 2009.
DOI : 10.1137/080713380

S. Karisch, F. Rendl, and J. Clausen, Solving Graph Bisection Problems with Semidefinite Programming, INFORMS Journal on Computing, vol.12, issue.3, pp.177-191, 2000.
DOI : 10.1287/ijoc.12.3.177.12637

J. Malick, J. Povh, F. Rendl, A. [. Wiegele, F. Malick et al., Regularization methods for semidefinite programming Numerical study of semidefinite bounds for the k-cluster problem, ISCO'10, International Symposium on Combinatorial Optimization. [MR11], pp.336-356, 2009.

J. Malick and F. Roupin, Solving k-cluster problems to optimality using adjustable semidefinite programming bounds, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01125758

J. Nocedal and S. J. Wright, Numerical Optimization, 1999.
DOI : 10.1007/b98874

P. Pardalos, L. D. Iasemidis, J. C. Sackellares, W. Chaovalitwongse, P. Carney et al., Seizure warning algorithm based on optimization and nonlinear dynamics Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Mathematical Programming, pp.365-385134, 1990.

S. Poljak, F. Rendl, and H. Wolkowicz, A recipe for semidefinite relaxation for (0,1)-quadratic programming, Mathematical Programming, pp.51-73353, 1993.
DOI : 10.1007/BF01100205

F. Roupin, From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems, Journal of Combinatorial Optimization, vol.8, issue.4, pp.469-493, 2004.
DOI : 10.1007/s10878-004-4838-6
URL : https://hal.archives-ouvertes.fr/hal-00596181

F. Rendl, G. Rinaldi, and A. Wiegele, Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations, Mathematical Programming, vol.29, issue.3, pp.307-335, 2010.
DOI : 10.1007/s10107-008-0235-8

D. Hanif, W. P. Sherali, and . Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.411-430, 1990.