[1]   Alain Billionnet and Sourour Elloumi. Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Mathematical Programming, 109:55–68, 2007. 10.1007/s10107-005-0637-9.

[2]   Richard H. Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput., 16(5):1190–1208, September 1995.

[3]   Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115–1145, November 1995.

[4]   Nathan Krislock, Jérôme Malick, and Frédéric Roupin. Improved semidefinite bounding procedure for solving max-cut problems to optimality. Mathematical Programming, 143(1-2):61–86, 2014.

[5]   Nathan Krislock, Jérôme Malick, and Frédéric Roupin. Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Computers and Operations Research, 66:153 – 159, 2016.

[6]   Amélie Lambert. A library of k-cluster problems. http://cedric.cnam.fr/~lamberta/Library/k-_cluster.html. CNAM-CEDRIC.

[7]   Bertrand Le Cun, Catherine Roucairol, and The Pnn Team. Bob: a unified platform for implementing branch-and-bound like algorithms. Technical report, Laboratoire Prism, 1995.

[8]   Jérôme Malick and Frédéric 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, 140(1):99–124, 2013.

[9]   Prabhakar Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci., 37(2):130–143, October 1988.

[10]   Prabhakar Raghavan and Clark D. Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365–374, December 1987.

[11]   Frédéric Roupin. From linear to semidefinite programming: An algorithm to obtain semidefinite relaxations for bivalent quadratic problems. Journal of Combinatorial Optimization, 8:469–493, 2004. 10.1007/s10878-004-4838-6.