{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:38:21Z","timestamp":1759667901993},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1016\/0167-8191(89)90025-2","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"151-162","source":"Crossref","is-referenced-by-count":16,"title":["Algorithms for assignment problems on an array processor"],"prefix":"10.1016","volume":"11","author":[{"given":"A.M","family":"Frieze","sequence":"first","affiliation":[]},{"given":"J","family":"Yadegar","sequence":"additional","affiliation":[]},{"given":"S","family":"El-Horbaty","sequence":"additional","affiliation":[]},{"given":"D","family":"Parkinson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90025-2_BIB1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.33.3.527","article-title":"Signature methods for the assignment problem","volume":"33","author":"Balinski","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/0167-8191(89)90025-2_BIB2","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BF01584237","article-title":"A new algorithm for the assignment problem","volume":"6","author":"Bertsekas","year":"1981","journal-title":"Math. Prog."},{"article-title":"Probabilistic asymptotic properties of quadratic assignment problems","year":"1981","author":"Burkard","key":"10.1016\/0167-8191(89)90025-2_BIB3"},{"key":"10.1016\/0167-8191(89)90025-2_BIB4","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":"European J. Oper. Res."},{"key":"10.1016\/0167-8191(89)90025-2_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01589437","article-title":"Linear program with random costs","volume":"35","author":"Dyer","year":"1986","journal-title":"Math. Prog."},{"key":"10.1016\/0167-8191(89)90025-2_BIB6","first-page":"1901","article-title":"Very high-speed computing systems","volume":"54","author":"Flynn","year":"1966"},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/0167-8191(89)90025-2_BIB7"},{"year":"1976","series-title":"Content Addressable Parallel Processors","author":"Foster","key":"10.1016\/0167-8191(89)90025-2_BIB8"},{"key":"10.1016\/0167-8191(89)90025-2_BIB9","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1057\/jors.1981.207","article-title":"An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice","volume":"32","author":"Frieze","year":"1981","journal-title":"J. Oper. Res. Soc."},{"year":"1979","series-title":"Computers and Intractability: A Guide to NP-Completeness","author":"Garey","key":"10.1016\/0167-8191(89)90025-2_BIB10"},{"key":"10.1016\/0167-8191(89)90025-2_BIB11","first-page":"116","article-title":"Software and algorithm for the Distributed Array Processor","volume":"1","author":"Gostick","year":"1979","journal-title":"ICL Tech. J."},{"key":"10.1016\/0167-8191(89)90025-2_BIB12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/mnsc.16.7.453","article-title":"An algorithm for the quadratic assignment problem","volume":"17","author":"Graves","year":"1970","journal-title":"Manag. Sci."},{"year":"1981","series-title":"Parallel Computers","author":"Hockney","key":"10.1016\/0167-8191(89)90025-2_BIB13"},{"key":"10.1016\/0167-8191(89)90025-2_BIB14","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","article-title":"Solving the assignment problem by relaxation","volume":"28","author":"Hung","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0167-8191(89)90025-2_BIB15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/0167-8191(89)90025-2_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problems","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Res. Logist. Quart."},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/0167-8191(89)90025-2_BIB17"},{"key":"10.1016\/0167-8191(89)90025-2_BIB18","series-title":"Presented at the International Symposium on Location Decisions","article-title":"Comparison of several heuristic algorithms to solve quadratic assignment problems of the Koopmans-Beckmans type","author":"Los","year":"1978"},{"key":"10.1016\/0167-8191(89)90025-2_BIB19","series-title":"Parallel Processing Systems","first-page":"215","article-title":"Practical parallel computers and their uses","author":"Parkinson","year":"1982"},{"key":"10.1016\/0167-8191(89)90025-2_BIB20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0010-4655(83)90031-0","article-title":"The Distributed Array Processor (DAP)","volume":"28","author":"Parkinson","year":"1983","journal-title":"Comput. Phys. Comm."},{"key":"10.1016\/0167-8191(89)90025-2_BIB21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0167-8191(87)90008-1","article-title":"Organisational aspects of using parallel computers","volume":"5","author":"Parkinson","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(89)90025-2_BIB22","first-page":"311","article-title":"The DAP approach","volume":"Vol. 2","author":"Reddaway","year":"1979"},{"key":"10.1016\/0167-8191(89)90025-2_BIB23","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(89)90025-2_BIB24","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":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900252?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900252?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:25:02Z","timestamp":1551068702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0167819189900252"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90025-2","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}