{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:50:30Z","timestamp":1648896630850},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,17]],"date-time":"2014-07-17T00:00:00Z","timestamp":1405555200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0768-0","type":"journal-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T06:53:54Z","timestamp":1405493634000},"page":"523-535","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Convex reformulation for binary quadratic programming problems via average objective value maximization"],"prefix":"10.1007","volume":"9","author":[{"given":"Cheng","family":"Lu","sequence":"first","affiliation":[]},{"given":"Xiaoling","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,17]]},"reference":[{"key":"768_CR1","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Chang, X.-W., Ku, W.-Y.: Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems. J. Global Optim. (2014)","DOI":"10.1007\/s10898-014-0148-4"},{"key":"768_CR2","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"768_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 Problem. Math. Program. 109, 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"768_CR4","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":"768_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman W.H., Madison (1979)"},{"key":"768_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"768_CR7","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10898-007-9155-z","volume":"39","author":"GD Halikias","year":"2007","unstructured":"Halikias, G.D., Jaimoukha, I.M., Malik, U., Gungah, S.K.: New bounds on the unconstrained quadratic integer problem. J. Global Optim. 39, 543\u2013554 (2007)","journal-title":"J. Global Optim."},{"key":"768_CR8","doi-asserted-by":"crossref","unstructured":"Lemarechal, C, Oustry, F.: SDP relaxations in combinatorial optimization from a Lagrangian point of view. In: Hadjisavvas, N., Pardalos, P. (eds) Proceedings of Advances in Convex Analysis and Global Optimization, pp. 119\u2013134. Kluwer Academic Press, New York (2001)","DOI":"10.1007\/978-1-4613-0279-7_6"},{"key":"768_CR9","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10898-009-9504-1","volume":"48","author":"C Lu","year":"2010","unstructured":"Lu, C., Wang, Z., Xing, W.: An improved lower bound and approximation algorithm for binary constrained quadratic programming problem. J. Global Optim. 48, 497\u2013508 (2010)","journal-title":"J. Global Optim."},{"key":"768_CR10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10107-005-0692-2","volume":"107","author":"U Malik","year":"2006","unstructured":"Malik, U., Jaimoukha, I.M., Halikias, G.D., Gungah, S.K.: On the gap between the quadratic integer programming problem and its semidefinite relaxation. Math. Program. 107, 505\u2013515 (2006)","journal-title":"Math. Program."},{"key":"768_CR11","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1109\/78.992139","volume":"50","author":"W-K Ma","year":"2002","unstructured":"Ma, W.-K., Davidson, T.N., Wong, K.M., Luo, Z.-Q., Cing, P.-C.: Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA. IEEE Trans. Signal Process. 50, 912\u2013922 (2002)","journal-title":"IEEE Trans. Signal Process."},{"key":"768_CR12","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/JSTSP.2009.2035798","volume":"3","author":"W-K Ma","year":"2009","unstructured":"Ma, W.-K., Su, C.-C., Jald\u00e9n, J., Chang, T.-H., Chi, C.-Y.: The equivalence of semidefinite relaxation MIMO detectors for higher-order QAM. IEEE J. Sel. Topics Signal Process. 3, 1038\u20131052 (2009)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"768_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"768_CR14","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/moor.20.3.550","volume":"20","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Wolkowicz, H.: Convex relaxations of (01)-quadratic programming. Math. Oper. Res. 20, 550\u2013561 (1995)","journal-title":"Math. Oper. Res."},{"key":"768_CR15","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/LSP.2006.874443","volume":"13","author":"ND Sidiropoulos","year":"2006","unstructured":"Sidiropoulos, N.D., Luo, Z.-Q.: A semidefinite relaxation approach to MIMO detection for higher-order QAM constellations. IEEE Signal Process. Lett. 13, 525\u2013528 (2006)","journal-title":"IEEE Signal Process. Lett."},{"key":"768_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10898-011-9683-4","volume":"53","author":"XL Sun","year":"2012","unstructured":"Sun, X.L., Liu, C.L., Li, D., Gao, J.J.: On duality gap in binary quadratic programming. J. Global Optim. 53, 255\u2013269 (2012)","journal-title":"J. Global Optim."},{"key":"768_CR17","first-page":"1142","volume":"19","author":"P Tan","year":"2001","unstructured":"Tan, P., Rasmussen, L.: The application of semidefinite programming for detection in CDMA. IEEE J. Sel. Areas Commun. 19, 1142\u20131449 (2001)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"768_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"768_CR19","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer programming. Wiley, New York (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0768-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0768-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0768-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:38Z","timestamp":1559409098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0768-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,17]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["768"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0768-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,17]]}}}