{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:38Z","timestamp":1759190798055,"version":"3.44.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0167-9260(97)00007-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:24:04Z","timestamp":1027610644000},"page":"101-113","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["A modified noising algorithm for the graph partitioning problem"],"prefix":"10.1016","volume":"22","author":[{"given":"V.","family":"Sudhakar","sequence":"first","affiliation":[]},{"given":"C.","family":"Siva Ram Murthy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-9260(97)00007-2_bib1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"10.1016\/S0167-9260(97)00007-2_bib2","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","article-title":"Heuristic algorithms for task assignment in distributed systems","volume":"37","author":"Lo","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(97)00007-2_bib3","first-page":"24","article-title":"Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing","volume":"134","author":"Shield","year":"1987"},{"issue":"2","key":"10.1016\/S0167-9260(97)00007-2_bib4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0165-6074(93)90249-K","article-title":"An efficient algorithm for mapping parallel programs onto multicomputers","volume":"36","author":"Selvakumar","year":"1993","journal-title":"Microprocessing Microprogramming"},{"key":"10.1016\/S0167-9260(97)00007-2_bib5","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0743-7315(90)90065-W","article-title":"The allocation problem in parallel production systems","volume":"8","author":"Dixit","year":"1990","journal-title":"J. Parallel Distirubuted Comput."},{"key":"10.1016\/S0167-9260(97)00007-2_bib6","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/0743-7315(91)90102-F","article-title":"Mapping rule-based systems onto multicomputers using simulated annealing","volume":"13","author":"Jain","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"issue":"4","key":"10.1016\/S0167-9260(97)00007-2_bib7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0169-023X(92)90045-D","article-title":"The knowledge base parititioning problem: mathematical formulation and heuristic clusteirng","volume":"8","author":"Raz","year":"1992","journal-title":"Data Knowledge Eng."},{"issue":"2","key":"10.1016\/S0167-9260(97)00007-2_bib8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/103724.103725","article-title":"VLSI placement techniques","volume":"23","author":"Shahookar","year":"1991","journal-title":"ACM Comput. Surveys"},{"year":"1987","series-title":"Simulated Annealing: Theory and Applications","author":"van Laarhoven","key":"10.1016\/S0167-9260(97)00007-2_bib9"},{"key":"10.1016\/S0167-9260(97)00007-2_bib10","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":"10.1016\/S0167-9260(97)00007-2_bib11","series-title":"Advanced School on Stochastics in Combinatorial Optimization","first-page":"76","article-title":"Randomized heuristics for NP-hard problems","author":"Maffioli","year":"1987"},{"issue":"6","key":"10.1016\/S0167-9260(97)00007-2_bib12","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Simulated annealing for optimization: An experimental evaluation. Part I, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-9260(97)00007-2_bib13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","article-title":"The noising method: a new method for combinatorial optimization","volume":"14","author":"Sharon","year":"1993","journal-title":"Oper. Res. Lett."},{"article-title":"Computers and Intractability","year":"1979","author":"Garey","key":"10.1016\/S0167-9260(97)00007-2_bib14"},{"key":"10.1016\/S0167-9260(97)00007-2_bib15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289116","article-title":"NP-hard problems in hierachical-tree clustering","volume":"23","author":"Krivanek","year":"1986","journal-title":"Acta Inform."},{"issue":"11","key":"10.1016\/S0167-9260(97)00007-2_bib16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","article-title":"Simulated annealing: a tool for operational research","volume":"46","author":"Eglese","year":"1990","journal-title":"European J. Oper. Res."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926097000072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926097000072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:12:31Z","timestamp":1759137151000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926097000072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0167926097000072"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(97)00007-2","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1997,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A modified noising algorithm for the graph partitioning problem","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(97)00007-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}