{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:52Z","timestamp":1751342872706,"version":"3.41.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1027364420370","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"237-245","source":"Crossref","is-referenced-by-count":4,"title":["A Tight Semidefinite Relaxation of the MAX CUT Problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Hongwei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Fengmin","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5149230_CR1","series-title":"Technical Report Research Report CORR","volume-title":"A strengthened SDP relaxation via a second lifting for the Max Cut problem","author":"M. Anjos","year":"1999","unstructured":"M. Anjos and H. Wolkowicz, \u201cA strengthened SDP relaxation via a second lifting for the Max Cut problem,\u201d Technical Report Research Report CORR 95-55, University of Waterloo, Waterloo, Ontario, 1999."},{"key":"5149230_CR2","series-title":"Research ReportCORR","volume-title":"A tight semidefinite relaxation of the cut polytope","author":"M. Anjos","year":"2000","unstructured":"M. Anjos and H. Wolkowicz, \u201cA tight semidefinite relaxation of the cut polytope,\u201d Research ReportCORR 2000-19, University of Waterloo, Waterloo, Ontario, 2000."},{"key":"5149230_CR3","series-title":"Technical Report TR","volume-title":"SDPpack user's guide- version 0.9 Beta","author":"F. Alizadeh","year":"1997","unstructured":"F. Alizadeh, J.-P. Haeberly, M.V. Nayakkankuppam, M.L. Overton, and S. Schmieta, \u201cSDPpack user's guide- version 0.9 Beta,\u201d Technical Report TR 1997-737, Courant Institute of Mathematical Science, NYU, New York, NY, June 1997."},{"issue":"3","key":"5149230_CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"F. Barahona, M. Grotschel, M. Junger, and G. Reinelt, \u201cAn application of combinatorial optimization to statistical physics and circuit layout design,\u201d Operations Research, vol. 36, no. 3, pp. 493-513, 1988.","journal-title":"Operations Research"},{"issue":"1","key":"5149230_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona and A.R. Mahjoub, \u201cOn the cut polytope,\u201d Mathematical Programming, vol. 36, no. 1, pp. 157-173, 1986.","journal-title":"Mathematical Programming"},{"issue":"6","key":"5149230_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"M.X. Goemans and D.P. Williamson, \u201cImproved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming,\u201d Journal of the ACM, vol. 42, no. 6, pp. 1115-1145, 1995.","journal-title":"Journal of the ACM"},{"issue":"2","key":"5149230_CR7","first-page":"225","volume":"77","author":"M. Laurent","year":"1997","unstructured":"M. Laurent, S. Poljak, and F. Rendl, \u201cConnections between semidefinite relaxations of the max-cut and stable set problems,\u201d Mathematical Programming, vol. 77, no. 2, pp. 225-246, 1997.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027364420370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027364420370\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027364420370.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:43:30Z","timestamp":1751283810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027364420370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5149230"],"URL":"https:\/\/doi.org\/10.1023\/a:1027364420370","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}