{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:29:30Z","timestamp":1773235770166,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,15]],"date-time":"2006-12-15T00:00:00Z","timestamp":1166140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,12]]},"DOI":"10.1007\/s10107-006-0062-8","type":"journal-article","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T08:12:52Z","timestamp":1166083972000},"page":"145-173","source":"Crossref","is-referenced-by-count":26,"title":["Semidefinite bounds for the stability number of a graph via sums of squares of polynomials"],"prefix":"10.1007","volume":"110","author":[{"given":"Neboj\u0161a","family":"Gvozdenovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,15]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I.M. Bomze","year":"2002","unstructured":"Bomze I.M. and Klerk E. (2002). Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24: 163\u2013185","journal-title":"J. Global Optim."},{"key":"62_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"S. Boyd","year":"1996","unstructured":"Boyd S. and Vandenberghe L. (1996). Semidefinite programming. SIAM Rev. 38: 49\u201395","journal-title":"SIAM Rev."},{"issue":"15","key":"62_CR3","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S. Busygin","year":"2006","unstructured":"Busygin S. (2006). A New Trust Region Technique for the Maximum Weight Clique Problem. Discrete Appl. Math. 154(15): 2080\u20132096","journal-title":"Discrete Appl. Math."},{"key":"62_CR4","unstructured":"Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. [Philips Research Reports Supplements (1973) No. 10] Philips Research Laboratories, Eindhoven (1973)"},{"key":"62_CR5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. De Klerk","year":"2002","unstructured":"De Klerk E. and Pasechnik D.V. (2002). Approximating the stability number of a graph via copositive programming. SIAM J. Optim. 12: 875\u2013892","journal-title":"SIAM J. Optim."},{"key":"62_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M., Lov\u00e1sz L. and Schrijver A. (1988). Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York"},{"key":"62_CR7","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre J.B. (2001). Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11: 796\u2013817","journal-title":"SIAM J. Optim."},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Lasserre J.B. (2001) An explicit exact SDP relaxation for nonlinear 0\u22121 programs. In: Aardal K., Gerards A.M.H. (eds.) Lecture Notes in Computer Science, vol. 2081, pp. 293\u2013303","DOI":"10.1007\/3-540-45535-3_23"},{"key":"62_CR9","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, Lov\u00e1sz-Schrijver and Lasserre relaxations for 0\u22121 programming. Math. Oper. Res. 28: 470\u2013496","journal-title":"Math. Oper. Res."},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Strengthened semidefinite programming bounds for codes. Math. Program. (in press) (2006)","DOI":"10.1007\/s10107-006-0030-3"},{"key":"62_CR11","doi-asserted-by":"crossref","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization, pp 393\u2013514 (2005)","DOI":"10.1016\/S0927-0507(05)12008-8"},{"key":"62_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L. (1979). On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25: 1\u20137","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L. and 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":"62_CR14","first-page":"134","volume":"3","author":"R.J. McEliece","year":"1978","unstructured":"McEliece R.J., Rodemich E.R. and Rumsey H.C. (1978). The Lov\u00e1sz\u2019 bound and some generalizations. J. Comb. Inf. Syst. Sci. 3: 134\u2013152","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"62_CR15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin T.S. and Straus E.G. (1965). Maxima for graphs and a new proof of a theorem of T\u00faran. Can. J. Math. 17: 533\u2013540","journal-title":"Can. J. Math."},{"key":"62_CR16","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology (2000)"},{"key":"62_CR17","unstructured":"Pe\u00f1a, J.F., Vera, J.C., Zuluaga, L.F.: Computing the stability number of a graph via linear and semidefinite programming. Preprint, 2005. Available at http:\/\/www.optimization-online. org\/DB_HTML\/2005\/04\/1106.html"},{"key":"62_CR18","unstructured":"P\u00f3lya, G.: Collected Papers, vol. 2, pp 309\u2013313. MIT Press, Cambridge, Mass., London (1974)"},{"key":"62_CR19","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. Preprint. Available at http:\/\/www.math.uiuc.edu\/~reznick\/"},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Reznick, B.: Sums of even powers of real linear forms. Memoirs of the American Mathematical Society, Number 463 (1992)","DOI":"10.1090\/memo\/0463"},{"key":"62_CR21","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A. Schrijver","year":"1979","unstructured":"Schrijver A. (1979). A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25: 425\u2013429","journal-title":"IEEE Trans. Inf. Theory"},{"key":"62_CR22","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A. (2003). Combinatorial Optimization\u2014Polyhedra and Efficiency. Springer, Berlin Heidelberg New York"},{"key":"62_CR23","doi-asserted-by":"crossref","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A. Schrijver","year":"2005","unstructured":"Schrijver A. (2005). New code upper bounds from the Terwiliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51: 2859\u20132866","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"62_CR24","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/S1052623403431779","volume":"15","author":"M. Schweighofer","year":"2005","unstructured":"Schweighofer M. (2005). Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3): 805\u2013825","journal-title":"SIAM J. Optim."},{"key":"62_CR25","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) (2000) Handbook of Semidefinite Programming. Kluwer, Boston\/Dordrecht\/London","DOI":"10.1007\/978-1-4615-4381-7"},{"issue":"4","key":"62_CR26","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1137\/03060151X","volume":"16","author":"L.F. Zuluaga","year":"2006","unstructured":"Zuluaga L.F., Vera J.C. and Pe\u00f1a J.F. (2006). LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16(4): 1076\u20131091","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0062-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0062-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0062-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:01Z","timestamp":1559109001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0062-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,15]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,12]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0062-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,15]]}}}