{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:39Z","timestamp":1759847679805},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0167-6377(92)90015-u","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"3-10","source":"Crossref","is-referenced-by-count":8,"title":["An improved partial solution to the task assignment and multiway cut problems"],"prefix":"10.1016","volume":"12","author":[{"given":"Vangelis F","family":"Magirou","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90015-U_BIB1","article-title":"Task assignment using network flow methods for minimizing communication in n-processor systems","author":"Abraham","year":"1986","journal-title":"Center for Supercomputing, Res. Develop. Technical Report 598"},{"key":"10.1016\/0167-6377(92)90015-U_BIB2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","article-title":"A shortest tree algorithm for optimal assignment across space and time in a distributed processing system","volume":"7","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Software Engng."},{"key":"10.1016\/0167-6377(92)90015-U_BIB3","article-title":"The complexity of multiway cuts","author":"Dahlhaus","year":"1983","journal-title":"Extended Abstract"},{"key":"10.1016\/0167-6377(92)90015-U_BIB4","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","article-title":"Heuristic algorithms for task assignment in distributed systems","volume":"37","author":"Lo","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/0167-6377(92)90015-U_BIB5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0167-6377(89)90022-9","article-title":"An algorithm for the multiprocessor assignment problem","volume":"8","author":"Magirou","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90015-U_BIB6","series-title":"Proc. Nat. Computer. Conf.","first-page":"291","article-title":"The assignment of computational tasks among processors in a distributed system","author":"Price","year":"1981"},{"key":"10.1016\/0167-6377(92)90015-U_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"3","author":"Stone","year":"1977","journal-title":"IEEE Trans. Software Engng."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290015U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290015U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:33Z","timestamp":1552902633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290015U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["016763779290015U"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90015-u","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}