{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:18:57Z","timestamp":1760707137115},"reference-count":13,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0305-0548(92)90050-f","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"287-295","source":"Crossref","is-referenced-by-count":29,"title":["A connectionist approach to the quadratic assignment problem"],"prefix":"10.1016","volume":"19","author":[{"given":"Jaishankar","family":"Chakrapani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jadranka","family":"Skorin-Kapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(92)90050-F_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(84)90093-6","article-title":"Quadratic assignment problems","volume":"15","author":"Burkard","year":"1984","journal-title":"Eur. J. Ops Res."},{"key":"10.1016\/0305-0548(92)90050-F_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0305-0548(92)90050-F_BIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0377-2217(89)90355-X","article-title":"Boltzmann machines for travelling salesman problems","volume":"39","author":"Aarts","year":"1989","journal-title":"Eur. J. Ops Res."},{"key":"10.1016\/0305-0548(92)90050-F_BIB4","series-title":"Simulated Annealing and Boltzmann Machines\u2014A Stochastic Approach to Combinatorial Optimization and Neural Computation","author":"Aarts","year":"1989"},{"key":"10.1016\/0305-0548(92)90050-F_BIB5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00363956","article-title":"On the stability of the travelling salesman problem algorithm of Hopfield and Tank","author":"Wilson","year":"1988","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0305-0548(92)90050-F_BIB6","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimizing by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0305-0548(92)90050-F_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014part i","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(92)90050-F_BIB8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2014part ii","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(92)90050-F_BIB9","article-title":"Some convergence results for probablistic tabu search","author":"Faigle","year":"1989"},{"key":"10.1016\/0305-0548(92)90050-F_BIB10","series-title":"Discrete Mathematics and Optimization","article-title":"Simulated annealing and Boltzmann machines","author":"Aarts","year":"1988"},{"key":"10.1016\/0305-0548(92)90050-F_BIB11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(92)90050-F_BIB12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","article-title":"An experimental comparison of techniques for the assignment of facilities to locations","volume":"16","author":"Nugent","year":"1968","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(92)90050-F_BIB13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1003003","article-title":"The backboard wiring problem: a placement algorithm","volume":"3","author":"Steinberg","year":"1961","journal-title":"SIAM Rev."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489290050F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489290050F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T05:48:46Z","timestamp":1704865726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489290050F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":13,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["030505489290050F"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(92)90050-f","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}