{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:43:07Z","timestamp":1729629787168,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/icnc.2012.6234769","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T19:43:57Z","timestamp":1342727037000},"page":"627-630","source":"Crossref","is-referenced-by-count":0,"title":["A PROBE-based algorithm for the max-cut problem"],"prefix":"10.1109","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1982.1585498"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497328987"},{"key":"15","first-page":"19","article-title":"The PROBE metaheuristic for the multiconstraint knapsack problem","author":"barake","year":"2004","journal-title":"Metaheuristics"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70760"},{"key":"13","first-page":"1173","volume":"18","author":"lin","year":"2008","journal-title":"An Ant Colony Algorithm for Solving Max-cut Problem"},{"key":"14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1090\/dimacs\/020\/04","article-title":"Maximum cuts and large bipartite subgraphs","volume":"20","author":"poljak","year":"1995","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0275"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2007.09.012"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.3.493"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1983.1085357"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1987.1270247"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1080\/1055678021000090033"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"5","article-title":"Partitioning similarity graphs: A framework for declustering problems","volume":"21","author":"shekhar","year":"1996","journal-title":"Information Systems Journal"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02178370"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400382467"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"}],"event":{"name":"2012 8th International Conference on Natural Computation (ICNC)","start":{"date-parts":[[2012,5,29]]},"location":"Chongqing, Sichuan, China","end":{"date-parts":[[2012,5,31]]}},"container-title":["2012 8th International Conference on Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6227653\/6234502\/06234769.pdf?arnumber=6234769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T05:05:54Z","timestamp":1561957554000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6234769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icnc.2012.6234769","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}