{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:20Z","timestamp":1750308740186,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,1,18]],"date-time":"2010-01-18T00:00:00Z","timestamp":1263772800000},"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":[[2010,1,18]]},"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. An earlier article discussed the fundamental problem and executing the backtracking in parallel. This article addresses the branch-and-bound approach and shows transforming that into a parallel algorithm.<\/jats:p>","DOI":"10.1145\/1709424.1709451","type":"journal-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T14:01:38Z","timestamp":1264514498000},"page":"78-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"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":[[2010,1,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595453.1595490"},{"key":"e_1_2_1_2_1","unstructured":"The complete chapter on Branch and Bound 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 Branch and Bound 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"}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1709424.1709451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1709424.1709451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:10Z","timestamp":1750278130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1709424.1709451"}},"subtitle":["further exploring parallelism"],"short-title":[],"issued":{"date-parts":[[2010,1,18]]},"references-count":2,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,1,18]]}},"alternative-id":["10.1145\/1709424.1709451"],"URL":"https:\/\/doi.org\/10.1145\/1709424.1709451","relation":{},"ISSN":["0097-8418"],"issn-type":[{"type":"print","value":"0097-8418"}],"subject":[],"published":{"date-parts":[[2010,1,18]]},"assertion":[{"value":"2010-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}