{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T10:00:05Z","timestamp":1771063205636,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,21]],"date-time":"2006-07-21T00:00:00Z","timestamp":1153440000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,3,26]]},"DOI":"10.1007\/s10288-006-0011-7","type":"journal-article","created":{"date-parts":[[2006,7,20]],"date-time":"2006-07-20T07:42:53Z","timestamp":1153381373000},"page":"75-88","source":"Crossref","is-referenced-by-count":23,"title":["Partial Lagrangian relaxation for general quadratic programming"],"prefix":"10.1007","volume":"5","author":[{"given":"Alain","family":"Faye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,21]]},"reference":[{"issue":"10","key":"11_CR1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams WP, Sherali HD (1986) A tight linearization and an algorithm for zero-one quadratic progamming problems. Manage Sci 32(10):1274\u20131290","journal-title":"Manage Sci"},{"issue":"3","key":"11_CR2","first-page":"171","volume":"43","author":"A Billionnet","year":"2005","unstructured":"Billionnet A (2005). Different formulations for solving the heaviest k-subgraph problem. Inf Syst Oper Res, 43(3):171\u2013186","journal-title":"Inf Syst Oper Res,"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C Helmberg","year":"2000","unstructured":"Helmberg C, Rendl F, Weismantel R (2000) A semidefinite approach to the Quadratic Knapsack Problem. J Comb Optim 4:197\u2013215","journal-title":"J Comb Optim"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent M (2003) A comparison of the Sherali-Adams, Lovasz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math Oper Res 28:470\u2013496","journal-title":"Math Oper Res"},{"key":"11_CR5","first-page":"7","volume":"1","author":"C Lemar\u00e9chal","year":"2003","unstructured":"Lemar\u00e9chal C (2003), The omnipresence of Lagrange. 4\u2019OR 1:7\u201325","journal-title":"4\u2019OR"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-1-4613-0279-7_6","volume-title":"Advances in convex analysis and global optim.","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal 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\u2013134"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L, Schrijver A (1991) Cones of matrices and set-functions and 0\u20131 optimization. SIAM J Optim 1:166\u2013190","journal-title":"SIAM J Optim"},{"key":"11_CR8","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"1989","unstructured":"Luenberger DG (1989) Linear and nonlinear programming. Addison Wesley, Reading"},{"key":"11_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1025-2","volume-title":"The mathematics of nonlinear programming","author":"AL Peressini","year":"1988","unstructured":"Peressini AL, Sullivan FE, Uhl Jr. JJ (1988) The mathematics of nonlinear programming. Undergraduate Texts in Mathematics, Springer, Berlin Heidelberg New york"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak S, Rendl F, Wolkowicz H (1995) A recipe for semidefinite relaxations for (0,1)-quadratic programming. J Global Optim 7:51\u201373","journal-title":"J Global Optim"},{"issue":"4","key":"11_CR11","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10878-004-4838-6","volume":"8","author":"F Roupin","year":"2004","unstructured":"Roupin F (2004) From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems. J Comb Optim 8(4): 469\u2013493","journal-title":"J Comb Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0011-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0011-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0011-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0011-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,21]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,26]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0011-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,21]]}}}