{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:31:34Z","timestamp":1759667494977},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,30]],"date-time":"2011-01-30T00:00:00Z","timestamp":1296345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s12532-011-0022-z","type":"journal-article","created":{"date-parts":[[2011,1,29]],"date-time":"2011-01-29T09:23:12Z","timestamp":1296292992000},"page":"37-57","source":"Crossref","is-referenced-by-count":11,"title":["Quadratic factorization heuristics for copositive programming"],"prefix":"10.1007","volume":"3","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Jarre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,30]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/9789812795212","volume-title":"Completely positive matrices","author":"A. Berman","year":"2003","unstructured":"Berman A., Shaked-Monderer N.: Completely positive matrices. World Scientific, Singapore (2003)"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I.M. Bomze","year":"2000","unstructured":"Bomze I.M., D\u00fcr M., de Klerk E., Quist A., Roos C., Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18, 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"key":"22_CR3","unstructured":"Bomze, I.M., Eichfelder, G.: Copositivity detection by difference-of-convex decomposition and omega-subdivision. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2010\/01\/2523.html (2010)"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1080\/02331930903395634","volume":"59","author":"I.M. Bomze","year":"2010","unstructured":"Bomze I.M., Frommlet F., Locatelli M.: Gap, cosum, and product properties of the \u03b8\u2032 bound on the clique number. Optimization 59, 1041\u20131051 (2010)","journal-title":"Optimization"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11590-010-0174-1","volume":"4","author":"I.M. Bomze","year":"2010","unstructured":"Bomze I.M., Jarre F.: A note on Burer\u2019s copositive representation of mixed-binary QPs. Optim. Lett. 4, 465\u2013472 (2010)","journal-title":"Optim. Lett."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1016\/j.laa.2007.09.035","volume":"428","author":"S. Bundfuss","year":"2008","unstructured":"Bundfuss S., D\u00fcr M.: Algorithmic Copositivity Detection by Simplicial Partition. Linear Algebra Appl. 428, 1511\u20131523 (2008)","journal-title":"Linear Algebra Appl."},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S. Bundfuss","year":"2009","unstructured":"Bundfuss S., D\u00fcr M.: An Adaptive Linear Approximation Algorithm for Copositive Programs. SIAM J. Optim. 20, 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"key":"22_CR8","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":"22_CR9","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 programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"22_CR10","first-page":"723","volume":"20","author":"P.J.C. Dickinson","year":"2010","unstructured":"Dickinson P.J.C.: An improved characterization of the interior of the completely positive cone. Electron. J. Linear Algebra 20, 723\u2013729 (2010)","journal-title":"Electron. J. Linear Algebra"},{"key":"22_CR11","unstructured":"DIMACS implementation challenges. Available at ftp:\/\/dimacs.rutgers.edu\/pub\/challenge\/graph"},{"key":"22_CR12","first-page":"48","volume":"17","author":"M. D\u00fcr","year":"2008","unstructured":"D\u00fcr M., Still G.: Interior points of the completely positive cone. Electron. J. Linear Algebra 17, 48\u201353 (2008)","journal-title":"Electron. J. Linear Algebra"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-008-0233-x","volume":"121","author":"I. Dukanovic","year":"2010","unstructured":"Dukanovic I., Rendl F.: Copositive programming motivated bounds on the stability and chromatic numbers. Math. Program. 121, 249\u2013268 (2010)","journal-title":"Math. Program."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.13001\/1081-3810.1245","volume":"17","author":"C.R. Johnson","year":"2008","unstructured":"Johnson C.R., Reams R.: Constructing copositive matrices from interior matrices. Electron. J. Linear Algebra 17, 9\u201320 (2008)","journal-title":"Electron. J. Linear Algebra"},{"key":"22_CR15","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":"22_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT\u201325","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory IT\u201325, 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR17","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":"22_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior point polynomial algorithms in convex programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov Y., Nemirovski A.: Interior point polynomial algorithms in convex programming. SIAM Publications, Philadelphia (1994)"},{"key":"22_CR19","unstructured":"Parrilo, P.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, USA (2000)"},{"key":"22_CR20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J. Povh","year":"2009","unstructured":"Povh J., Rendl F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. 6, 231\u2013241 (2009)","journal-title":"Discret. Optim."},{"key":"22_CR21","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"IT\u201325","author":"A. Schrijver","year":"1979","unstructured":"Schrijver A.: A comparison of the Delsarte and Lovasz bounds. IEEE Trans. Inf. Theory IT\u201325, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR22","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D., Nemhauser G.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102, 559\u2013575 (2005)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0022-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-011-0022-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0022-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:15:56Z","timestamp":1559463356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-011-0022-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,30]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s12532-011-0022-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,30]]}}}