{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:11Z","timestamp":1725559151880},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_11","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T12:40:39Z","timestamp":1279111239000},"page":"136-151","source":"Crossref","is-referenced-by-count":6,"title":["Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials"],"prefix":"10.1007","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","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I.M. Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Journal of Global Optimization\u00a024, 163\u2013185 (2002)","journal-title":"Journal of Global Optimization"},{"key":"11_CR2","unstructured":"Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. [Philips Research Reports Supplements, No. 10] Philips Research Laboratories, Eindhoven (1973)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. Klerk De","year":"2002","unstructured":"De Klerk, E., Pasechnik, D.V.: Approximating the stability number of a graph via copositive programming. SIAM Journal on Optimization\u00a012, 875\u2013892 (2002)","journal-title":"SIAM Journal on Optimization"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization\u00a011, 796\u2013817 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0\u2009\u2212\u20091 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 293\u2013303. Springer, Heidelberg (2001)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M. Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver and Lasserre relaxations for 0\u2009\u2212\u20091 programming. Mathematics of Operations Research\u00a028, 470\u2013496 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"11_CR7","unstructured":"Laurent, M.: Strengthened Semidefinite Bounds for Codes (2005) Preprint. Available at, \n                  \n                    http:\/\/www.cwi.nl\/~monique"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory\u00a025, 1\u20137 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u2009\u2212\u20091 optimization. SIAM Journal on Optimization\u00a01, 166\u2013190 (1991)","journal-title":"SIAM Journal on Optimization"},{"key":"11_CR10","first-page":"134","volume":"3","author":"R.J. McEliece","year":"1978","unstructured":"McEliece, R.J., Rodemich, E.R., Rumsey, H.C.: The Lov\u00e1sz\u2019 bound and some generalizations. Journal of Combinatorics, Information & System Sciences\u00a03, 134\u2013152 (1978)","journal-title":"Journal of Combinatorics, Information & System Sciences"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of T\u00faran. Canadian J. Math.\u00a017, 533\u2013540 (1965)","journal-title":"Canadian J. Math."},{"key":"11_CR12","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology (2000)"},{"key":"11_CR13","first-page":"309","volume-title":"Collected Papers","author":"G. P\u00f3lya","year":"1974","unstructured":"P\u00f3lya, G.: Collected Papers, vol.\u00a02, pp. 309\u2013313. MIT Press, Cambridge (1974)"},{"key":"11_CR14","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. Preprint. Available at, \n                  \n                    http:\/\/www.math.uiuc.edu\/~reznick\/"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Reznick, B.: Sums of even powers of real linear forms. Memoirs of the American Mathematical Society\u00a0463 (1992)","DOI":"10.1090\/memo\/0463"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A. Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inform. Theory\u00a025, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"11_CR17","unstructured":"Schrijver, A.: New code upper bounds from the Terwiliger algebra (2004). Preprint. Available at \n                  \n                    http:\/\/www.cwi.nl\/~lex"},{"key":"11_CR18","unstructured":"Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM Journal on Optimization (to appear), Available at \n                  \n                    http:\/\/www.math.uni-konstanz.de\/~schweigh\/"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:40:19Z","timestamp":1619491219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11496915_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}