{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:56:08Z","timestamp":1772837768039,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,16]],"date-time":"2010-05-16T00:00:00Z","timestamp":1273968000000},"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":[[2010,7]]},"DOI":"10.1007\/s10107-010-0363-9","type":"journal-article","created":{"date-parts":[[2010,5,15]],"date-time":"2010-05-15T02:16:14Z","timestamp":1273889774000},"page":"13-32","source":"Crossref","is-referenced-by-count":14,"title":["Copositivity cuts for improving SDP bounds on the clique number"],"prefix":"10.1007","volume":"124","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Frommlet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,16]]},"reference":[{"key":"363_CR1","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/978-0-387-74759-0_99","volume-title":"Encyclopedia of Optimization","author":"I.M. Bomze","year":"2009","unstructured":"Bomze I.M.: Copositive optimization. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization, pp. 561\u2013564. Springer, New York (2009)"},{"key":"363_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization (supp., vol. A)","author":"I.M. Bomze","year":"1999","unstructured":"Bomze I.M., Budinich M., Pardalos P., Pelillo M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization (supp., vol. A), pp. 1\u201374. Kluwer, Dordrecht (1999)"},{"key":"363_CR3","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Frommlet, F., Locatelli, M.: Gap, cosum, and product properties of the \u03b8\u2032 bound on the clique number. To appear in Optimization (2010)","DOI":"10.1080\/02331930903395634"},{"key":"363_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"I.M. Bomze","year":"2008","unstructured":"Bomze I.M., Locatelli M., Tardella F.: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115, 31\u201364 (2008)","journal-title":"Math. Program."},{"key":"363_CR5","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"363_CR6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S. Burer","year":"2009","unstructured":"Burer S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"363_CR7","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1007\/978-0-387-74759-0_100","volume-title":"Encyclopedia of Optimization","author":"S. Busygin","year":"2009","unstructured":"Busygin S.: Copositive programming. In: Floudas, C.A., Pardalos, P.M. (eds) Encyclopedia of Optimization (2nd edn), pp. 564\u2013567. Springer, New York (2009)","edition":"2"},{"key":"363_CR8","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. Klerk de","year":"2002","unstructured":"de Klerk E., Pasechnik D.V.: Approximation of the stability number of a graph via copositive programsming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"363_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-006-0026-z","volume":"109","author":"I. Dukanovi\u0107","year":"2007","unstructured":"Dukanovi\u0107 I., Rendl F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program. B 109, 345\u2013365 (2007)","journal-title":"Math. Program. B"},{"key":"363_CR10","doi-asserted-by":"crossref","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. In: Lecture Notes in Computer Science, vol. 3509, 136\u2013151. Springer, New York (2005)","DOI":"10.1007\/11496915_11"},{"key":"363_CR11","first-page":"1","volume":"22","author":"D.E. Knuth","year":"1994","unstructured":"Knuth D.E.: The sandwich theorem. Electron. J. Comb. 22, 1\u201348 (1994)","journal-title":"Electron. J. Comb."},{"key":"363_CR12","doi-asserted-by":"crossref","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 J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"363_CR13","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programming. In: Aardal K., Gerards A.H.M. (eds.) Lecture Notes in Computer Science, vol. 2081, 293\u2013303. Springer, New York (2001)","DOI":"10.1007\/3-540-45535-3_23"},{"key":"363_CR14","doi-asserted-by":"crossref","unstructured":"Loefberg, J.: YALMIP : A Toolbox for Modeling and Optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"key":"363_CR15","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.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"363_CR16","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. J. Comb. Inf. Syst. Sci. 3, 134\u2013152 (1978)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"363_CR17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J. Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a J., Vera J., Zuluaga L.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18, 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"key":"363_CR18","doi-asserted-by":"crossref","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 Lovasz bounds. IEEE Trans. Inf. Theory 25, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0363-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0363-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0363-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0363-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,16]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0363-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,16]]}}}