{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T23:29:36Z","timestamp":1711754976733},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T00:00:00Z","timestamp":1423785600000},"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 Optim Appl"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10589-015-9731-y","type":"journal-article","created":{"date-parts":[[2015,2,12]],"date-time":"2015-02-12T02:02:55Z","timestamp":1423706575000},"page":"669-688","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques"],"prefix":"10.1007","volume":"61","author":[{"given":"Felix","family":"Lieder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatemeh Bani Asadi","family":"Rad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Jarre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,13]]},"reference":[{"key":"9731_CR1","unstructured":"Arima, N., Kim, S., Kojima, M.: Simplified copositive and lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables, Research Report B-469. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo (2012)"},{"key":"9731_CR2","unstructured":"Benson, S.J., Ye, Y.: Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation (1999) http:\/\/www.stanford.edu\/~yyye\/yyye\/stable.ps"},{"key":"9731_CR3","series-title":"Semidefinite relaxations, multivariate normal distributions, and order statistics","volume-title":"Handbook of Combinatorial Optimization","author":"D Bertsimas","year":"1998","unstructured":"Bertsimas, D., Ye, Y.: Handbook of Combinatorial Optimization. Semidefinite relaxations, multivariate normal distributions, and order statistics. Kluwer Academic Publishers, Boston (1998)"},{"key":"9731_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"2","key":"9731_CR5","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. Prog. 120(2), 479\u2013495 (2009)","journal-title":"Math. Prog."},{"key":"9731_CR6","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1007\/s11590-013-0645-2","volume":"7","author":"PJ Dickinson","year":"2013","unstructured":"Dickinson, P.J., Eichfelder, G., Povh, Janez: Erratum to: on the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 7, 1387\u20131397 (2013)","journal-title":"Optim. Lett."},{"key":"9731_CR7","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s11590-012-0450-3","volume":"7","author":"G Eichfelder","year":"2013","unstructured":"Eichfelder, G., Povh, Janez: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 7, 1373\u20131386 (2013)","journal-title":"Optim. Lett."},{"key":"9731_CR8","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"},{"issue":"3","key":"9731_CR9","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S089547989631442X","volume":"21","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C.: Fixing variables in semidefinite relaxations. SIAM J. Matrix Anal. Appl. 21(3), 952\u2013969 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"9731_CR10","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, B., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9731_CR11","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s11590-010-0269-8","volume":"6","author":"F Jarre","year":"2012","unstructured":"Jarre, F.: Burer\u2019s key assumption for semidefinite and doubly nonnegative relaxations. Optim. Lett. 6(3), 593\u2013599 (2012)","journal-title":"Optim. Lett."},{"issue":"1","key":"9731_CR12","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/S0097539797321481","volume":"29","author":"H Karloff","year":"1999","unstructured":"Karloff, H.: How good is the Goemans-Williamson max cut algorithm? SIAM J. Comput. 29(1), 336\u2013350 (1999)","journal-title":"SIAM J. Comput."},{"key":"9731_CR13","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming (2003) http:\/\/homepages.cwi.nl\/~monique\/files\/chaptercwi.ps"},{"issue":"1","key":"9731_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lovasz","year":"1979","unstructured":"Lovasz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9731_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Prog. 121(2), 307\u2013335 (2010)","journal-title":"Math. Prog."},{"key":"9731_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH Tutuncu","year":"2003","unstructured":"Tutuncu, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189\u2013217 (2003)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9731-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9731-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9731-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:39Z","timestamp":1559241459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9731-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,13]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9731"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9731-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,13]]}}}