{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:51:06Z","timestamp":1762429866231},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0141-9331(92)90038-u","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T01:33:26Z","timestamp":1047692006000},"page":"149-158","source":"Crossref","is-referenced-by-count":18,"title":["Parallel techniques for solving large scale travelling salesperson problems"],"prefix":"10.1016","volume":"16","author":[{"given":"CP","family":"Ravikumar","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0141-9331(92)90038-U_BIB1","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the travelling-salesman problem","volume":"Vol 21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"issue":"No 4598","key":"10.1016\/0141-9331(92)90038-U_BIB2","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"Vol 220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"No 1","key":"10.1016\/0141-9331(92)90038-U_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city symmetric traveling salesman problem by branch and cut","volume":"Vol 6","author":"Padberg","year":"1987","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0141-9331(92)90038-U_BIB4","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1145\/2135.2141","article-title":"Improved solution to the traveling salesman problem with thousands of nodes","author":"Litke","year":"1984","journal-title":"Comm. ACM."},{"issue":"No 10","key":"10.1016\/0141-9331(92)90038-U_BIB5","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1080\/00207548908942657","article-title":"IC insertion: an application of the travelling salesman problem","volume":"Vol 27","author":"Chan","year":"1989","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/0141-9331(92)90038-U_BIB6","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1287\/opre.28.3.694","article-title":"Approximate traveling salesman algorithms","volume":"Vol 28","author":"Golden","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0141-9331(92)90038-U_BIB7","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","year":"1985"},{"key":"10.1016\/0141-9331(92)90038-U_BIB8","series-title":"Programming Parallel Processors","article-title":"Intel iPSC concurrent computer","author":"Pase","year":"1987"},{"key":"10.1016\/0141-9331(92)90038-U_BIB9","series-title":"FX\/Fortran Programmer's Manual","year":"1987"},{"key":"10.1016\/0141-9331(92)90038-U_BIB10","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0141-9331(92)90038-U_BIB11","series-title":"Proceedings of the International Conference on Computer Design","first-page":"4","article-title":"A parallel simulated annealing algorithm for channel routing on a hypercube multiprocessor","author":"Brouwer","year":"1988"},{"key":"10.1016\/0141-9331(92)90038-U_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TCS.1981.1084903","article-title":"An efficient algorithm for the two-dimensional placement problem in electrical circuit layout","volume":"Vol CAS-28","author":"Goto","year":"1981","journal-title":"IEEE Trans. Circ. Syst."},{"key":"10.1016\/0141-9331(92)90038-U_BIB13","series-title":"Assignment and Matching Problems: Solution Methods with FORTRAN Programs","author":"Burkard","year":"1980"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014193319290038U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014193319290038U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T04:26:28Z","timestamp":1553487988000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/014193319290038U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["014193319290038U"],"URL":"https:\/\/doi.org\/10.1016\/0141-9331(92)90038-u","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}