Maximizing quadratic programs : extending Grothendieck's inequalityCHARIKAR, Moses; WIRTH, Anthony.Annual Symposium on Foundations of Computer Science. 2004, pp 54-60, isbn 0-7695-2228-9, 1Vol, 7 p.Conference Paper

On the gap between the quadratic integer programming problem and its semidefinite relaxationMALIK, U; JAIMOUKHA, I. M; HALIKIAS, G. D et al.Mathematical programming. 2006, Vol 107, Num 3, pp 505-515, issn 0025-5610, 11 p.Article

A derivation of Lovász' theta via augmented Lagrange dualityPINAR, Mustapha C.RAIRO. Recherche opérationnelle. 2003, Vol 37, Num 1, pp 17-27, issn 0399-0559, 11 p.Article

A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0 - 1 programmingLAURENT, Monique.Report - Probability, networks and algorithms. 2001, Num 8, pp 1-26, issn 1386-3711Article

Convexity Properties Associated with Nonconvex Quadratic Matrix Functions and Applications to Quadratic ProgrammingBECK, A.Journal of optimization theory and applications. 2009, Vol 142, Num 1, pp 1-29, issn 0022-3239, 29 p.Article

A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphsGOUVEIA, Joao; LAURENT, Monique; PARRILO, Pablo A et al.Mathematical programming (Print). 2012, Vol 133, Num 1-2, pp 203-225, issn 0025-5610, 23 p.Article

A new semidefinite programming relaxation scheme for a class of quadratic matrix problemsBECK, Amir; DRORI, Yoel; TEBOULLE, Marc et al.Operations research letters. 2012, Vol 40, Num 4, pp 298-302, issn 0167-6377, 5 p.Article

Improved estimation of duality gap in binary quadratic programming using a weighted distance measureYONG XIA; SHEU, Ruey-Lin; XIAOLING SUN et al.European journal of operational research. 2012, Vol 218, Num 2, pp 351-357, issn 0377-2217, 7 p.Article

Semidefinite bounds for the stability number of a graph via sums of squares of polynomialsGVOZDENOVIC, Nebojsa; LAURENT, Monique.Lecture notes in computer science. 2005, pp 136-151, issn 0302-9743, isbn 3-540-26199-0, 16 p.Conference Paper

Sums of random symmetric matrices and quadratic optimization under orthogonality constraintsNEMIROVSKI, Arkadi.Mathematical programming. 2007, Vol 109, Num 2-3, pp 283-317, issn 0025-5610, 35 p.Conference Paper

Semidefinite Relaxations of Robust Binary Least Squares Under Ellipsoidal Uncertainty SetsTSAKONAS, Efthymios E; JALDEN, Joakim; OTTERSTEN, Bjöm et al.IEEE transactions on signal processing. 2011, Vol 59, Num 11, pp 5169-5180, issn 1053-587X, 12 p.Article

A Semidefinite Relaxation Approach to Spreading Sequence Estimation for DS-SS SignalsZHANG, Hua Guo; MOU, Qing; LIAO, Hong Shu et al.IEICE transactions on communications. 2011, Vol 94, Num 11, pp 3163-3167, issn 0916-8516, 5 p.Article

A direct formulation for sparse PCA using semidefinite programmingD'ASPREMONT, Alexandre; EL GHAOUI, Laurent; JORDAN, Michael I et al.SIAM review (Print). 2007, Vol 49, Num 3, pp 434-448, issn 0036-1445, 15 p.Article

Semidefinite representations for finite varietiesLAURENT, Monique.Mathematical programming. 2007, Vol 109, Num 1, pp 1-26, issn 0025-5610, 26 p.Article

Sparsity in sums of squares of polynomialsKOJIMA, Masakazu; KIM, Sunyoung; WAKI, Hayato et al.Mathematical programming. 2005, Vol 103, Num 1, pp 45-62, issn 0025-5610, 18 p.Article

On approximate graph colouring and MAX-k-CUT algorithms based on the v-functionDE KLERK, E; PASECHNIK, D. V; WARNERS, J. P et al.Journal of combinatorial optimization. 2004, Vol 8, Num 3, pp 267-294, issn 1382-6905, 28 p.Article

The probable value of the Lovász-Schrijver relaxations for maximum independent setFEIGE, Uriel; KRAUTHGAMER, Robert.SIAM journal on computing (Print). 2003, Vol 32, Num 2, pp 345-370, issn 0097-5397, 26 p.Article

Spectral bounds for unconstrained (―1,1)-quadratic optimization problemsBEN-AMEUR, Walid; NETO, José.European journal of operational research. 2010, Vol 207, Num 1, pp 15-24, issn 0377-2217, 10 p.Article

Block-diagonal semidefinite programming hierarchies for 0/1 programmingGVOZDENOVIC, Nebojsa; LAURENT, Monique; VALLENTIN, Frank et al.Operations research letters. 2009, Vol 37, Num 1, pp 27-31, issn 0167-6377, 5 p.Article

The equivalence of semidefinite relaxations of polynomial 0-1 and ±1 programs via scalingCHEUNG, Kevin K. H.Operations research letters. 2008, Vol 36, Num 3, pp 314-316, issn 0167-6377, 3 p.Article

Semidefinite bounds for the stability number of a graph via sums of squares of polynomialsGVOZDENOVIC, Nebojsa; LAURENT, Monique.Mathematical programming. 2007, Vol 110, Num 1, pp 145-173, issn 0025-5610, 29 p.Conference Paper

Semidefinite programming based approaches to home-away assignment problems in sports schedulingSUZUKA, Ayami; MIYASHIRO, Ryuhei; YOSHISE, Akiko et al.Lecture notes in computer science. 2005, pp 95-103, issn 0302-9743, isbn 3-540-26224-5, 9 p.Conference Paper

Exploiting semidefinite relaxations in constraint programmingVAN HOEVE, Willem-Jan.Computers & operations research. 2006, Vol 33, Num 10, pp 2787-2804, issn 0305-0548, 18 p.Conference Paper

An improved semidefinite programming relaxation for the satisfiability problemANJOS, Miguel F.Mathematical programming. 2005, Vol 102, Num 3, pp 589-608, issn 0025-5610, 20 p.Article

Upper bounds and exact algorithms for p-dispersion problemsPISINGER, David.Computers & operations research. 2006, Vol 33, Num 5, pp 1380-1398, issn 0305-0548, 19 p.Article