{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:56:05Z","timestamp":1760644565078,"version":"3.40.2"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1109\/tcad.2002.1004312","type":"journal-article","created":{"date-parts":[[2002,11,7]],"date-time":"2002-11-07T19:41:04Z","timestamp":1036698064000},"page":"685-693","source":"Crossref","is-referenced-by-count":28,"title":["Multilevel cooperative search for the circuit\/hypergraph partitioning problem"],"prefix":"10.1109","volume":"21","author":[{"given":"M.","family":"Ouyang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Toulouse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Thulasiraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.S.","family":"Deogun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1997.597204"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.254.5035.1181"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/157485.165119"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/43.573831"},{"article-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1147\/rd.411.0171"},{"key":"ref8","first-page":"231","article-title":"Solving the really hard problems with cooperative search","volume-title":"Proc. 11th National Conf. Artificial Intelligence (AAA93):","author":"Hogg"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.79.8.2554.PMC346238.PMID6953413"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(90)90065-W"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1999.781339"},{"key":"ref13","first-page":"III 177","article-title":"Efficient parallelization of simulated annealing using multiple Markov chains: An application to graph partitioning","volume-title":"Proc. 1992 Int. Conf. Parallel Processing","author":"Lee"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2172\/435291"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/12.8730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61723-X_1049"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1998.725012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48311-X_75"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/21685\/01004312.pdf?arnumber=1004312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T06:47:45Z","timestamp":1742712465000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004312\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.2002.1004312","relation":{},"ISSN":["0278-0070"],"issn-type":[{"type":"print","value":"0278-0070"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}