{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:47:27Z","timestamp":1763016447494,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/0743-7315(91)90092-n","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"228-236","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"title":["On the massively parallel solution of the assignment problem"],"prefix":"10.1016","volume":"13","author":[{"given":"Joel M.","family":"Wein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros A.","family":"Zenios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"New scaling algorithms for the assignment and minimum cycle mean problems","year":"1988","author":"Ahuja","key":"10.1016\/0743-7315(91)90092-N_BIB1"},{"key":"10.1016\/0743-7315(91)90092-N_BIB2","doi-asserted-by":"crossref","DOI":"10.21236\/ADA233588","article-title":"A parallel shortest path algorithm for the assignment problem","author":"Balas","year":"1989"},{"article-title":"A distributed algorithm for the assignment problem","year":"1979","author":"Bertsekas","key":"10.1016\/0743-7315(91)90092-N_BIB3"},{"key":"10.1016\/0743-7315(91)90092-N_BIB4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","article-title":"The auction algorithm: A distributed algorithm for the assignment and other network flow problems","volume":"14","author":"Bertsekas","year":"1988","journal-title":"Ann. Oper. Res."},{"article-title":"Parallel synchronous and asynchronous implementations of the auction algorithm","year":"1989","author":"Bertsekas","key":"10.1016\/0743-7315(91)90092-N_BIB5"},{"year":"1989","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","key":"10.1016\/0743-7315(91)90092-N_BIB6"},{"key":"10.1016\/0743-7315(91)90092-N_BIB7","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BF01589405","article-title":"Dual coordinate step methods for linear network flow problems","volume":"42","author":"Bertsekas","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0743-7315(91)90092-N_BIB8","series-title":"Proc. International Conference on Parallel Processing","first-page":"355","article-title":"Scans as primitive parallel operations","author":"Blelloch","year":"1987"},{"key":"10.1016\/0743-7315(91)90092-N_BIB9","unstructured":"Castanon, D., Smith, B., and Wilson, A. Performance of parallel assignment algorithms on different multiprocessor architectures. Argonne National Laboratory Rep. in preparation."},{"key":"10.1016\/0743-7315(91)90092-N_BIB10","article-title":"Model CM-2 technical summary","author":"Thinking Machines Corp.","year":"1987","journal-title":"Tech. Rep. HA87-4"},{"article-title":"Splitting methods for monotone operators with applications to parallel optimization","year":"1989","author":"Eckstein","key":"10.1016\/0743-7315(91)90092-N_BIB11"},{"key":"10.1016\/0743-7315(91)90092-N_BIB12","unstructured":"Eckstein, J. Implementing and running the alternating step method on the connection machine CM-2. ORSA J. Comput., to appear."},{"article-title":"An alternating direction method for linear programming","year":"1990","author":"Eckstein","key":"10.1016\/0743-7315(91)90092-N_BIB13"},{"key":"10.1016\/0743-7315(91)90092-N_BIB14","series-title":"Proc. 29th Annual Symposium on Foundations of Computer Science","first-page":"174","article-title":"Sublinear-time parallel algorithms for matching and related problems","author":"Goldberg","year":"1988"},{"key":"10.1016\/0743-7315(91)90092-N_BIB15","series-title":"Proc. 30th Annual Symposium on Foundations of Computer Science","article-title":"Interior point methods in parallel computation","author":"Goldberg","year":"1989"},{"key":"10.1016\/0743-7315(91)90092-N_BIB16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","article-title":"Multiplier and gradient methods","volume":"4","author":"Hestenes","year":"1969","journal-title":"J. Optim. Theory Appl."},{"year":"1985","series-title":"The Connection Machine","author":"Hillis","key":"10.1016\/0743-7315(91)90092-N_BIB17"},{"key":"10.1016\/0743-7315(91)90092-N_BIB18","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","article-title":"A shortest augmenting path algorithm for dense and sparse linear assignment problems","volume":"38","author":"Jonker","year":"1987","journal-title":"Computing"},{"article-title":"Performance characteristics of the Jacobi and Gauss-Seidel versions of the auction algorithm on the Alliant FX\/8","year":"1989","author":"Kempa","key":"10.1016\/0743-7315(91)90092-N_BIB19"},{"article-title":"Solving dense assignment problems on a shared memory multiprocessor","year":"1988","author":"Kennington","key":"10.1016\/0743-7315(91)90092-N_BIB20"},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/0743-7315(91)90092-N_BIB21"},{"key":"10.1016\/0743-7315(91)90092-N_BIB22_1","series-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","first-page":"345","article-title":"Matching is as easy as matrix inversion","author":"Mulmuley","year":"1987"},{"key":"10.1016\/0743-7315(91)90092-N_BIB22_2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0743-7315(91)90092-N_BIB23","series-title":"Impact ofRecent Computer Advances on Operations Research","first-page":"169","article-title":"Experiences with large scale network optimization on the Connection Machine","author":"Phillips","year":"1989"},{"key":"10.1016\/0743-7315(91)90092-N_BIB24","series-title":"Optimization","article-title":"A method for nonlinear constraints in minimization problems","author":"Powell","year":"1969"},{"article-title":"Algorithms for scheduling and network problems","year":"1991","author":"Wein","key":"10.1016\/0743-7315(91)90092-N_BIB25"},{"article-title":"A comparison of two algorithms for the assignment problem","year":"1990","author":"Zaki","key":"10.1016\/0743-7315(91)90092-N_BIB26"},{"key":"10.1016\/0743-7315(91)90092-N_BIB27","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1287\/ijoc.2.2.112","article-title":"Matrix balancing on a massively parallel connection machine","volume":"2","author":"Zenios","year":"1990","journal-title":"ORSA. J Comput."},{"key":"10.1016\/0743-7315(91)90092-N_BIB28","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0801024","article-title":"Massively parallel row auction algorithms for same nonlinear transportation problems","volume":"1","author":"Zenios","year":"1991","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190092N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190092N?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:29:04Z","timestamp":1757514544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190092N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["074373159190092N"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90092-n","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the massively parallel solution of the assignment problem","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(91)90092-N","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}