{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:14:37Z","timestamp":1774415677891,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006366","name":"Minist\u00e9rio da Educa\u00e7\u00e3o","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006366","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DCR 84-5 1396"],"award-info":[{"award-number":["DCR 84-5 1396"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004284","name":"Xerox","doi-asserted-by":"publisher","award":["3638\/81-4"],"award-info":[{"award-number":["3638\/81-4"]}],"id":[{"id":"10.13039\/100004284","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004284","name":"Xerox","doi-asserted-by":"publisher","award":["W8508 13"],"award-info":[{"award-number":["W8508 13"]}],"id":[{"id":"10.13039\/100004284","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0743-7315(89)90067-1","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"411-434","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["A distributed implementation of simulated annealing"],"prefix":"10.1016","volume":"6","author":[{"given":"Valmir C.","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90067-1_BIB1","series-title":"Workshop on Statistical Physics in Engineering and Biology","article-title":"Optimization by simulated annealing: An experimental evaluation","author":"Aragon","year":"1984"},{"key":"10.1016\/0743-7315(89)90067-1_BIB2","article-title":"Concurrency in systems with neighborhood constraints","author":"Barbosa","year":"1986"},{"key":"10.1016\/0743-7315(89)90067-1_BIB3","series-title":"Proc. Seventh International Conference on Distributed Computing Systems","first-page":"448","article-title":"Concurrency in heavily loaded neighborhood-constrained systems","author":"Barbosa","year":"1987"},{"key":"10.1016\/0743-7315(89)90067-1_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0743-7315(89)90067-1_BIB5","series-title":"Proc. Third Annual ACM Symposium on Principles of Distributed Computing","first-page":"285","article-title":"A distributed algorithm for generalized deadlock detection","author":"Bracha","year":"1984"},{"issue":"4","key":"10.1016\/0743-7315(89)90067-1_BIB6","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","article-title":"The drinking philosophers problem","volume":"6","author":"Chandy","year":"1984","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"1","key":"10.1016\/0743-7315(89)90067-1_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: Determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0743-7315(89)90067-1_BIB8","series-title":"Proc. Third Annual ACM Sym-posium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0743-7315(89)90067-1_BIB9","series-title":"Proc. International Conference on Parallel Processing","first-page":"6","article-title":"The traveling salesman problem on a hypercubic, MIMD computer","author":"Felten","year":"1985"},{"issue":"1","key":"10.1016\/0743-7315(89)90067-1_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","article-title":"Distributed algorithms for generating loop-free routes in networks with frequently changing topology","volume":"COM-29","author":"Gafni","year":"1981","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0743-7315(89)90067-1_BIB11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0743-7315(89)90067-1_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"6","key":"10.1016\/0743-7315(89)90067-1_BIB13","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","article-title":"Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images","volume":"PAMI-6","author":"Geman","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/0743-7315(89)90067-1_BIB14","series-title":"Proc. Eighteenth Annual ACM Symposium on Theory of Computing","first-page":"136","article-title":"A new approach to the maximum flow problem","author":"Goldberg","year":"1986"},{"key":"10.1016\/0743-7315(89)90067-1_BIB15","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"4598","key":"10.1016\/0743-7315(89)90067-1_BIB16","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"},{"issue":"7","key":"10.1016\/0743-7315(89)90067-1_BIB17","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(89)90067-1_BIB18","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0743-7315(89)90067-1_BIB19","series-title":"Introduction to Linear and Nonlinear Programming","author":"Luenberger","year":"1973"},{"key":"10.1016\/0743-7315(89)90067-1_BIB20","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"issue":"1","key":"10.1016\/0743-7315(89)90067-1_BIB21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01011714","article-title":"Gibbs and Markov random systems with constraints","volume":"10","author":"Moussouris","year":"1974","journal-title":"J. Statist. Phys."},{"key":"10.1016\/0743-7315(89)90067-1_BIB22","series-title":"Combinatorial Optimization","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0743-7315(89)90067-1_BIB23","series-title":"Evidential reasoning using stochastic simulation of causal models. R-68-1","author":"Pearl","year":"1986"},{"issue":"1","key":"10.1016\/0743-7315(89)90067-1_BIB24","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(89)90067-1_BIB25","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1080\/00029890.1971.11992710","article-title":"Markov random fields and Gibbs ensembles","volume":"78","author":"Spitzer","year":"1971","journal-title":"Amer. Math. Monthly"},{"issue":"2","key":"10.1016\/0743-7315(89)90067-1_BIB26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","article-title":"n-tuple colorings and associated graphs","volume":"20","author":"Stahl","year":"1976","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:55Z","timestamp":1757514535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0743731589900671"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90067-1","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A distributed implementation of simulated annealing","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90067-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}