{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:58:52Z","timestamp":1770479932624,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,10,21]],"date-time":"2006-10-21T00:00:00Z","timestamp":1161388800000},"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,1,30]]},"DOI":"10.1007\/s10107-006-0030-3","type":"journal-article","created":{"date-parts":[[2006,10,20]],"date-time":"2006-10-20T05:53:43Z","timestamp":1161323623000},"page":"239-261","source":"Crossref","is-referenced-by-count":32,"title":["Strengthened semidefinite programming bounds for codes"],"prefix":"10.1007","volume":"109","author":[{"given":"Monique","family":"Laurent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,21]]},"reference":[{"key":"30_CR1","unstructured":"De Klerk E., Pasechnik, D.: A note on the stability number of an orthogonality graph, European Journal of Combinatorics (to appear)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"De Klerk, E., Pasechnik, D., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular \u2217-representation. Math. Programm. Ser. B. DOI 10.1007\/s10107-006-0039-7 (2006)","DOI":"10.1007\/s10107-006-0039-7"},{"key":"30_CR3","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":"30_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K. Gaterman","year":"2004","unstructured":"Gaterman K., Parrilo P. (2004) Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192, 95\u2013128","journal-title":"J. Pure Appl. Algebra"},{"key":"30_CR5","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., Schrijver A. (1988) Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York"},{"key":"30_CR6","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":"30_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume":"2081","author":"J.B. Lasserre","year":"2001","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 2081, 293\u2013303","journal-title":"In: Aardal, K., Gerards, A.M.H., (eds.) Lecture Notes in Computer Science"},{"issue":"3","key":"30_CR8","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(3): 470\u2013496","journal-title":"Math. Oper. Res."},{"key":"30_CR9","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. Inform. Theory 25, 1\u20137","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR10","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\u22121 optimization. SIAM J. Optim. 1, 166\u2013190","journal-title":"SIAM J. Optim."},{"key":"30_CR11","first-page":"134","volume":"3","author":"R.J. McEliece","year":"1978","unstructured":"McEliece R.J., Rodemich E.R., Rumsey H.C. (1978) The Lov\u00e1sz\u2019 bound and some generalizations. J. Combin. Inform. Syst. Sci. 3, 134\u2013152","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"30_CR12","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. Inform. Theory 25, 425\u2013429","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR13","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 Terwilliger algebra and semidefinite programming. IEEE Trans. Inform. Theory 51, 2859\u20132866","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6188-9","volume-title":"Theory of Operator Algebras I","author":"M. Takesaki","year":"1979","unstructured":"Takesaki M. (1979) Theory of Operator Algebras I. Springer, Berlin Heidelberg New York"},{"key":"30_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1022494701663","volume":"1","author":"P. Terwilliger","year":"1992","unstructured":"Terwilliger P. (1992) The subconstituent algebra of an association scheme (Part I). J. Appl. Combin. 1, 363\u2013388","journal-title":"J. Appl. Combin."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0030-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0030-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0030-3","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-0030-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,21]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,1,30]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0030-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,21]]}}}