{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T04:41:43Z","timestamp":1777524103823,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642329630","type":"print"},{"value":"9783642329647","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32964-7_30","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T18:49:32Z","timestamp":1345920572000},"page":"297-306","source":"Crossref","is-referenced-by-count":10,"title":["A Memetic Approach for the Max-Cut Problem"],"prefix":"10.1007","author":[{"given":"Qinghua","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"30_CR1","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","volume":"15","author":"U. Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.K.: A multilevel memetic approach for improving graph k-partitions. IEEE Transactions on Evolutionary Computation\u00a015(5), 624\u2013642 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","unstructured":"Burer, S., Monteiro, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization\u00a012, 503\u2013521 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"30_CR3","volume-title":"Genetic algorithms and grouping problems","author":"E. Falkenauer","year":"1998","unstructured":"Falkenauer, E.: Genetic algorithms and grouping problems. Wiley, New York (1998)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"7","author":"P. Festa","year":"2002","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the max-cut problem. Optimization Methods and Software\u00a07, 1033\u20131058 (2002)","journal-title":"Optimization Methods and Software"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved approximation algorithm for max k-cut and max-bisection. Algorithmica\u00a018, 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-011-0983-3","volume":"191","author":"P. Galinier","year":"2011","unstructured":"Galinier, P., Boujbel, Z., Fernandes, M.C.: An efficient memetic algorithm for the graph partitioning problem. Annals of Operations Research\u00a0191(1), 1\u201322 (2011)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"9","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.pnsc.2008.04.006","volume":"18","author":"L. Gao","year":"2008","unstructured":"Gao, L., Zeng, Y., Dong, A.: An ant colony algorithm for solving Max-cut problem. Progress in Natural Science\u00a018(9), 1173\u20131178 (2008)","journal-title":"Progress in Natural Science"},{"issue":"6","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the Association for Computing Machinery\u00a042(6), 1115\u20131145 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thacher, J.W. (eds.) Complexity of Computer Computation, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"30_CR11","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 Journal on Computing\u00a012, 177\u2013191 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR12","unstructured":"Kim, S.H., Kim, Y.H., Moon, B.Y.: A Hybrid Genetic Algorithm for the MAX CUT Problem. In: Genetic and Evolutionary Computation Conference, pp. 416\u2013423 (2001)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Kochenberger, G., Hao, J.K., L\u00fc, Z., Wang, H., Glover, F.: Solving large scale max cut problems via tabu search. Accepted to Journal of Heuristics (2012)","DOI":"10.1007\/s10732-011-9189-8"},{"key":"30_CR14","doi-asserted-by":"publisher","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. Computational Optimization and Applications\u00a033, 51\u201371 (2006)","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","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 Journal on Computing\u00a021(1), 26\u201338 (2009)","journal-title":"INFORMS Journal on Computing"},{"issue":"31","key":"30_CR16","first-page":"29","volume":"2","author":"G. Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Application of multistart tabu search to the MaxCut problem. Information Technology and Control\u00a02(31), 29\u201335 (2004)","journal-title":"Information Technology and Control"},{"issue":"10","key":"30_CR17","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1016\/j.cor.2010.01.015","volume":"37","author":"D.C. Porumbel","year":"2010","unstructured":"Porumbel, D.C., Hao, J.K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Computers and Operations Research\u00a037(10), 1822\u20131832 (2010)","journal-title":"Computers and Operations Research"},{"key":"30_CR18","doi-asserted-by":"publisher","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. Mathematical Programming\u00a0121, 307\u2013335 (2008)","journal-title":"Mathematical Programming"},{"issue":"5","key":"30_CR19","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/s10559-010-9256-4","volume":"46","author":"V.P. Shylo","year":"2010","unstructured":"Shylo, V.P., Shylo, O.V.: Solving the maxcut problem by the global equilibrium search. Cybernetics and Systems Analysis\u00a046(5), 744\u2013754 (2010)","journal-title":"Cybernetics and Systems Analysis"},{"issue":"2","key":"30_CR20","first-page":"27","volume":"10","author":"J. Wang","year":"2006","unstructured":"Wang, J.: An Improved Maximum Neural Network Algorithm for Maximum Cut Problem. Neural Information Processing\u00a010(2), 27\u201334 (2006)","journal-title":"Neural Information Processing"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.K.: Probabilistic GRASP-tabu search algorithms for the UBQP problem. Accepted to Computers and Operations Research (2012), http:\/\/dx.doi.org\/10.1016\/j.cor.2011.12.006","DOI":"10.1016\/j.cor.2011.12.006"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Wu, Q., Hao, J.K.: Memetic search for the max-bisection problem. Accepted to Computers and Operations Research (2012), http:\/\/dx.doi.org\/10.1016\/j.cor.2012.06.001","DOI":"10.1016\/j.cor.2012.06.001"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32964-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:11:04Z","timestamp":1606187464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32964-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329630","9783642329647"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32964-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}