{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:31:45Z","timestamp":1770535905687,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10287-018-0337-6","type":"journal-article","created":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T03:08:48Z","timestamp":1543201728000},"page":"593-619","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches"],"prefix":"10.1007","volume":"16","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianqiang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J. C.","family":"Dickinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1318-6679","authenticated-orcid":false,"given":"Abdel","family":"Lisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,26]]},"reference":[{"key":"337_CR1","first-page":"437","volume":"10","author":"N Arima","year":"2014","unstructured":"Arima N, Kim S, Kojima M (2014) Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables. Pac J Optim 10:437\u2013451","journal-title":"Pac J Optim"},{"key":"337_CR2","volume-title":"Nonlinear programming: theory and algorithms","author":"M Bazaraa","year":"1979","unstructured":"Bazaraa M, Shetty CM (1979) Nonlinear programming: theory and algorithms. Wiley, New York"},{"key":"337_CR3","unstructured":"Beasley J (2010) OR-library. \nhttp:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"337_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze IM, D\u00fcr M, de Klerk E, Roos C, Quist AJ, Terlaky T (2000) On copositive programming and standard quadratic optimization problems. J Glob Optim 18:301\u2013320","journal-title":"J Glob Optim"},{"key":"337_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10898-011-9749-3","volume":"52","author":"IM Bomze","year":"2012","unstructured":"Bomze IM, Schachinger W, Uchida G (2012) Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization. J Glob Optim 52:423\u2013445","journal-title":"J Glob Optim"},{"key":"337_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/140973207","volume":"36","author":"IM Bomze","year":"2015","unstructured":"Bomze IM, Schachinger W, Ullrich R (2015) New lower bounds and asymptotics for the cp-rank. SIAM J Matrix Anal Appl 36:20\u201337","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1\u20132","key":"337_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-017-1109-8","volume":"166","author":"IM Bomze","year":"2017","unstructured":"Bomze IM, Cheng J, Dickinson PJC, Lisser A (2017) A fresh CP look at mixed-binary QPs: new formulations and relaxations. Math Program 166(1\u20132):159\u2013184","journal-title":"Math Program"},{"key":"337_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math Program 120:479\u2013495","journal-title":"Math Program"},{"key":"337_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer S (2010) Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math Program Comput 2:1\u201319","journal-title":"Math Program Comput"},{"key":"337_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"S Burer","year":"2015","unstructured":"Burer S (2015) A gentle, geometric introduction to copositive optimization. Math Program 151:89\u2013116","journal-title":"Math Program"},{"issue":"4","key":"337_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard RE, Karisch SE, Rendl F (1997) QAPLIB\u2014a quadratic assignment problem library. J Glob Optim 10(4):391\u2013403","journal-title":"J Glob Optim"},{"key":"337_CR12","doi-asserted-by":"publisher","first-page":"723","DOI":"10.13001\/1081-3810.1404","volume":"20","author":"PJC Dickinson","year":"2010","unstructured":"Dickinson PJC (2010) An improved characterisation of the interior of the completely positive cone. Electron J Linear Algebra 20:723\u2013729","journal-title":"Electron J Linear Algebra"},{"key":"337_CR13","unstructured":"Dickinson PJC (2013) The copositive cone, the completely positive cone and their generalisations, Ph.D. thesis. University of Groningen"},{"issue":"2","key":"337_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-013-9594-z","volume":"57","author":"PJC Dickinson","year":"2014","unstructured":"Dickinson PJC, Gijben L (2014) On the computational complexity of membership problems for the completely positive cone and its dual. Comput Optim Appl. 57(2):403\u2013415. \nhttps:\/\/doi.org\/10.1007\/s10589-013-9594-z","journal-title":"Comput Optim Appl."},{"key":"337_CR15","doi-asserted-by":"crossref","unstructured":"Grant M, Boyd S (2008) Graph implementations for nonsmooth convex programs. In: Blondel V, Boyd S, Kimura H (eds) Recent advances in learning and control (a tribute to M. Vidyasagar), Lecture Notes in Control and Information Sciences. Springer, Berlin, pp 95\u2013110. \nhttp:\/\/stanford.edu\/~boyd\/graph_dcp.html","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"337_CR16","unstructured":"Grant M, Boyd S (2013) CVX: Matlab software for disciplined convex programming, version 2.0 beta. \nhttp:\/\/cvxr.com\/cvx"},{"issue":"3","key":"337_CR17","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF02591907","volume":"27","author":"KC Kiwiel","year":"1983","unstructured":"Kiwiel KC (1983) An aggregate subgradient method for nonsmooth convex minimization. Math Program 27(3):320\u2013341","journal-title":"Math Program"},{"issue":"2","key":"337_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty KG, Kabadi SN (1987) Some NP-complete problems in quadratic and nonlinear programming. Math Program 39(2):117\u2013129","journal-title":"Math Program"},{"issue":"2","key":"337_CR19","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1080\/03081087.2013.869591","volume":"63","author":"N Shaked-Monderer","year":"2015","unstructured":"Shaked-Monderer N, Berman A, Bomze IM, Jarre F, Schachinger W (2015) New results on the cp rank and related properties of co(mpletely )positive matrices. Linear Multilinear Algebra 63(2):384\u2013396","journal-title":"Linear Multilinear Algebra"},{"key":"337_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discrete Math 3:411\u2013430","journal-title":"SIAM J Discrete Math"},{"key":"337_CR21","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim Methods Softw 11\u201312:625\u2013653","journal-title":"Optim Methods Softw"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0337-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-018-0337-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0337-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T19:15:01Z","timestamp":1574709301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-018-0337-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,26]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["337"],"URL":"https:\/\/doi.org\/10.1007\/s10287-018-0337-6","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,26]]},"assertion":[{"value":"16 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}