Partial Lagrangian relaxation for general quadratic programming

Adams WP, Sherali HD (1986) A tight linearization and an algorithm for zero-one quadratic progamming problems. Manage Sci 32(10):1274–1290

Billionnet A (2005). Different formulations for solving the heaviest k-subgraph problem. Inf Syst Oper Res, 43(3):171–186

Helmberg C, Rendl F, Weismantel R (2000) A semidefinite approach to the Quadratic Knapsack Problem. J Comb Optim 4:197–215

Laurent M (2003) A comparison of the Sherali-Adams, Lovasz-Schrijver, and Lasserre relaxations for 0–1 programming. Math Oper Res 28:470–496

Lemaréchal C (2003), The omnipresence of Lagrange. 4’OR 1:7–25

Lemaréchal C, Oustry F (2001) Semidefinite relaxations in combinatorial optimization from a lagrangian point of view. In: Hadjisavvas N, Pardalos PM, (eds), Advances in convex analysis and global optim. Kluwer, Dordrecht, pp. 119–134

Lovász L, Schrijver A (1991) Cones of matrices and set-functions and 0–1 optimization. SIAM J Optim 1:166–190

Luenberger DG (1989) Linear and nonlinear programming. Addison Wesley, Reading

Peressini AL, Sullivan FE, Uhl Jr. JJ (1988) The mathematics of nonlinear programming. Undergraduate Texts in Mathematics, Springer, Berlin Heidelberg New york

Poljak S, Rendl F, Wolkowicz H (1995) A recipe for semidefinite relaxations for (0,1)-quadratic programming. J Global Optim 7:51–73

Roupin F (2004) From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems. J Comb Optim 8(4): 469–493