{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:04Z","timestamp":1750307704127,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T00:00:00Z","timestamp":1245888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[2009,6,25]]},"abstract":"<jats:p>The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. Since the processing of permutation families (based on low-subscripted vector assignments) can be done independently of each other, one may examine parallel processing strategies, and discovery of instances in which the parallel execution is a very bad idea. Because of article size limitations, this article discusses only backtracking in parallel. A later article will address branch-and-bound in parallel.<\/jats:p>","DOI":"10.1145\/1595453.1595490","type":"journal-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T14:08:31Z","timestamp":1251122911000},"page":"127-131","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The assignment problem"],"prefix":"10.1145","volume":"41","author":[{"given":"Timothy J.","family":"Rolfe","sequence":"first","affiliation":[{"name":"Eastern Washington University, Cheney, Washington"}]}],"member":"320","published-online":{"date-parts":[[2009,6,25]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"312","author":"Brassard Gilles","year":"1996","journal-title":"Inc."},{"key":"e_1_2_1_2_1","unstructured":"The complete chapter on backtracking from Sartaj Sahni's Data Structures Algorithms and Applications in Java (Silicon Press 2004) is at http:\/\/www.cise.ufl.edu\/~sahni\/dsaaj\/chapters.htm  The complete chapter on backtracking from Sartaj Sahni's Data Structures Algorithms and Applications in Java (Silicon Press 2004) is at http:\/\/www.cise.ufl.edu\/~sahni\/dsaaj\/chapters.htm"},{"issue":"5","key":"e_1_2_1_3_1","first-page":"50","volume":"29","author":"Rolfe Timothy","year":"2004","journal-title":"Dr. Dobb's Journal"},{"issue":"2","key":"e_1_2_1_4_1","first-page":"46","volume":"28","author":"Rolfe Timothy","year":"2003","journal-title":"Dr. Dobb's Journal"}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1595453.1595490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1595453.1595490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:04Z","timestamp":1750253404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1595453.1595490"}},"subtitle":["exploring parallelism"],"short-title":[],"issued":{"date-parts":[[2009,6,25]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6,25]]}},"alternative-id":["10.1145\/1595453.1595490"],"URL":"https:\/\/doi.org\/10.1145\/1595453.1595490","relation":{},"ISSN":["0097-8418"],"issn-type":[{"type":"print","value":"0097-8418"}],"subject":[],"published":{"date-parts":[[2009,6,25]]},"assertion":[{"value":"2009-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}