{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:48:15Z","timestamp":1778572095219,"version":"3.51.4"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001321","name":"National Research Foundation of Korea funded by the Korea government","doi-asserted-by":"publisher","award":["NRF-2011-0009958"],"award-info":[{"award-number":["NRF-2011-0009958"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1109\/tevc.2014.2338076","type":"journal-article","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T18:44:46Z","timestamp":1405017886000},"page":"465-473","source":"Crossref","is-referenced-by-count":14,"title":["An Edge-Set Representation Based on a Spanning Tree for Searching Cut Space"],"prefix":"10.1109","volume":"19","author":[{"given":"Kisung","family":"Seo","sequence":"first","affiliation":[]},{"given":"Soohwan","family":"Hyun","sequence":"additional","affiliation":[]},{"given":"Yong-Hyuk","family":"Kim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"A combinatorial design approach to MAXCUT","author":"hofmeister","year":"1995","journal-title":"Proc Symp Theoretical Aspects Comput Sci"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/12.67327"},{"key":"ref33","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"},{"key":"ref32","author":"ford","year":"1962","journal-title":"Flows in Network"},{"key":"ref31","volume":"173","author":"diestel","year":"2005","journal-title":"Graph Theory"},{"key":"ref30","author":"biggs","year":"1994","journal-title":"Algebraic Graph Theory"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1982-036-8"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90023-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-011-9154-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/11730095_1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_51"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45105-6_120"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32444-5_2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/070214"},{"key":"ref22","article-title":"High-performance VNS for the MAX-CUT problem using commodity graphics hardware","author":"antonio","year":"2005","journal-title":"Proc 18th Mini Euro Conf VNS"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/080116"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896312262"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/43.494703"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1142\/S0129053394000160"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63138-0_23"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1142\/S021821300600262X"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/12.508322","article-title":"Genetic algorithm and graph partitioning","volume":"45","author":"bui","year":"1996","journal-title":"IEEE Trans Comput"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/903765"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/43.700718","article-title":"GRCA: A hybrid genetic algorithm for circuit ratio-cut partitioning","volume":"17","author":"bui","year":"1998","journal-title":"IEEE Trans Comput -Aided Design Integr Circuits Syst"},{"key":"ref10","article-title":"Algorithms for graph partitioning: A survey","volume":"3","author":"fj\u00e4llstr\u00f6m","year":"0","journal-title":"Linköping Electronic Articles in Computer and Information Science"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144188"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69839-5_63"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/B:HEUR.0000019985.94952.eb","article-title":"Lock-gain based graph partitioning","volume":"10","author":"kim","year":"2004","journal-title":"J Heuristics"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000026263.43711.44"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00103-K"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.445"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90147-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00148-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3837\/tiis.2008.04.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389306"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/540936"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90126-G"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"ref49","year":"2013","journal-title":"The boost library"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00189-7"},{"key":"ref46","first-page":"123","article-title":"Optimal layer assignment for interconnect","volume":"1","author":"pinter","year":"1984","journal-title":"J VLSI Comput Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.3.493"},{"key":"ref48","first-page":"184","article-title":"Fitness distance correlation as a measure of problem difficulty for genetic algorithms","author":"jones","year":"1995","journal-title":"Proceedings of the 6th International Conference on Genetic Algorithms"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1090\/dimacs\/020\/04","article-title":"Maximum cuts and largest bipartite subgraphs","volume":"20","author":"poljak","year":"1995","journal-title":"Discrete Math Theor Computer Sci Amer Math Soc (Combinatorial Optimization DIMACS)"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1381"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32964-7_30"},{"key":"ref43","first-page":"416","article-title":"A hybrid genetic algorithm for the MAX CUT problem","author":"kim","year":"2001","journal-title":"Proc Genetic Evol Comput Conf"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/7169633\/06851939.pdf?arnumber=6851939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:05:37Z","timestamp":1642003537000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6851939\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":53,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2014.2338076","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}