乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,17]],"date-time":"2024-03-17T09:30:51Z","timestamp":1710667851868},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/tc.2013.7","type":"journal-article","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T19:07:55Z","timestamp":1357931275000},"page":"1365-1376","source":"Crossref","is-referenced-by-count":18,"title":["An Efficient Memetic Algorithm for theMax-Bisection Problem"],"prefix":"10.1109","volume":"63","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Mathematics, Minjiang University, Fuzhou, China"}]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[{"name":"Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou, China"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.asoc.2009.07.010","article-title":"A Memetic Algorithm Applied to the Design of Water Distribution Networks","volume":"10","author":"ba\u00f1os","year":"2010","journal-title":"Applied Soft Computing"},{"key":"ref57","author":"alizadeh","year":"1997","journal-title":"SDPPack User's Guide (version 0 9 beta)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2011.01.038"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0275"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883266"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2109376"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2011991"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.09.011"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883273"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1080\/1055678021000090033"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.01.003"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497328987"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.07.034"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","article-title":"A Memetic Algorithm for Graph Coloring","volume":"203","author":"l\u00fc","year":"2010","journal-title":"European J Operational Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70760"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24652-7_9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"ref45","author":"karypis","year":"1998","journal-title":"hMetis A Hypergraph Partitioning Package"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.10.007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.04.005"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00027-7"},{"key":"ref41","author":"dawkins","year":"1989","journal-title":"The Selfish Gene"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.21236\/ADA439577"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00104-X"},{"key":"ref49","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(94)90137-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585164"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0916028"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270247"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.01.013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02510238"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396660"},{"key":"ref40","first-page":"219","article-title":"Memetic Algorithms: A Short Introduction","author":"moscato","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(02)00027-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400382467"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.04.012"},{"key":"ref36","first-page":"619","article-title":"A Feasible Direction Algorithm without Line Search for Solving Max-Bisection Problems","volume":"23","author":"xu","year":"2005","journal-title":"J Computational Math"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523688"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10035"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011415"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.3.493"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592948"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2011.01.015"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2007.08.018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258536"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.177.12637"},{"key":"ref26","author":"jansen","year":"2000","journal-title":"A Polynomial Time Approximation Scheme for Max-Bisection on Planer Graphs"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225140"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02073939"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614373"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581107"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00189-7"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970139567X"},{"key":"ref29","first-page":"369","article-title":"Approximation Algorithms for Max-Bisection on Low Degree Regular Graphs","volume":"62","author":"karpinski","year":"2004","journal-title":"Fundamenta Informaticae"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/6828816\/06409831.pdf?arnumber=6409831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T22:51:15Z","timestamp":1683067875000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6409831\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":57,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tc.2013.7","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}