{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:15:48Z","timestamp":1648955748175},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":[[1976,1]]},"DOI":"10.1016\/0305-0548(76)90006-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"49-56","source":"Crossref","is-referenced-by-count":1,"title":["Pre-partitioning as a means of enhancing pairwise interchange solutions to quadratic assignment problems"],"prefix":"10.1016","volume":"3","author":[{"given":"A.M.","family":"Patel","sequence":"first","affiliation":[]},{"given":"C.G.","family":"Dewald","sequence":"additional","affiliation":[]},{"given":"L.C.","family":"Cote","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(76)90006-X_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","article-title":"An r-dimensional quadratic placement algorithm","volume":"17","author":"Hall","year":"1970","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(76)90006-X_BIB2","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/1014035","article-title":"Review of the placement and quadratic assignment problems","volume":"14","author":"Hanan","year":"1972","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(76)90006-X_BIB3","article-title":"A partitioning-interchange algorithm for positioning logic elements on electronic chips","author":"Patel","year":"1971"},{"issue":"12","key":"10.1016\/0305-0548(76)90006-X_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1971.223157","article-title":"A heuristic procedure for the partitioning and mapping of computer logic graphs","volume":"C-20","author":"Russo","year":"1971","journal-title":"IEEE Trans Computers"},{"key":"10.1016\/0305-0548(76)90006-X_BIB5","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:030505487690006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505487690006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:24:45Z","timestamp":1552911885000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505487690006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["030505487690006X"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(76)90006-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}