{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T02:38:15Z","timestamp":1778553495386,"version":"3.51.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,9,14]],"date-time":"2011-09-14T00:00:00Z","timestamp":1315958400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10732-011-9189-8","type":"journal-article","created":{"date-parts":[[2011,9,13]],"date-time":"2011-09-13T19:59:30Z","timestamp":1315943970000},"page":"565-571","source":"Crossref","is-referenced-by-count":61,"title":["Solving large scale Max Cut problems via tabu search"],"prefix":"10.1007","volume":"19","author":[{"given":"Gary A.","family":"Kochenberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,14]]},"reference":[{"key":"9189_CR1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E. Boros","year":"1991","unstructured":"Boros, E., Hammer, P.: The Max-Cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33, 151\u2013180 (1991)","journal-title":"Ann. Oper. Res."},{"key":"9189_CR2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","unstructured":"Burer, S., Monteiro, D., Zang, Y.: Rank-two relaxation heuristic for Max-Cut and other binary quadratic programs. SIAM J. Optim. 12, 503\u2013521 (2001)","journal-title":"SIAM J. Optim."},{"key":"9189_CR3","unstructured":"Choi, C., Ye, Y.: Solving sparse semidefinite programs using the dual scaling algorithm with an iterative solver. Working Paper, Department of Management Sciences, The University of Iowa (2000)"},{"key":"9189_CR4","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"7","author":"P. Festa","year":"2002","unstructured":"Festa, P., Pardalos, P., Resende, M., Ribeiro, C.: Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 7, 1033\u20131058 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9189_CR5","author":"F. Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR, Q. J. Oper. Res. (2010). doi: 10.1007\/s10288-009-0115-y","journal-title":"4OR, Q. J. Oper. Res."},{"key":"9189_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for Max-Cut and satisfiability problems using Semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9189_CR7","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0-1) problems by semidefinite programs and cutting planes. Working Paper, Technische Universitat Graz (1996)"},{"key":"9189_CR8","first-page":"177","volume":"12","author":"S. Karish","year":"2000","unstructured":"Karish, S., Rendl, F., Clausen, J.: Solving graph bisection problems with semidefinite programming. SIAM J. Comput. 12, 177\u2013191 (2000)","journal-title":"SIAM J. Comput."},{"key":"9189_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10589-005-5958-3","volume":"33","author":"K. Krishnan","year":"2006","unstructured":"Krishnan, K., Mitchell, J.: A semidefinite programming based polyhedral cut and price approach for the Max-Cut problem. Comput. Optim. Appl. 33, 51\u201371 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9189_CR10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R. Marti","year":"2009","unstructured":"Marti, R., Duarte, A., Laguna, M.: Advanced scatter search for the Max-Cut problem. INFORMS J. Comput. 21, 26\u201338 (2009)","journal-title":"INFORMS J. Comput."},{"key":"9189_CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F. Rendl","year":"2008","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307\u2013335 (2008)","journal-title":"Math. Program."},{"key":"9189_CR12","series-title":"DIMACS Series in Discrete Mathematics and Computer Science","volume-title":"Special Year on Combinatorial Optimization","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., Tuza, Z.: The Max-Cut problem: a survey. In: Cook, W., Lovasz, L., Seymour, P. (eds.) Special Year on Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Computer Science. Am. Math. Soc., Providence (1995)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9189-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9189-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9189-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:32Z","timestamp":1559256872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9189-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,14]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9189"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9189-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,14]]}}}