{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:34:22Z","timestamp":1648712062222},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995,1]]},"DOI":"10.1016\/0167-8191(94)00072-i","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:18:22Z","timestamp":1027639102000},"page":"63-71","source":"Crossref","is-referenced-by-count":0,"title":["A parallel implementation of the column subtraction algorithm"],"prefix":"10.1016","volume":"21","author":[{"given":"T.H.C.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.L.","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)00072-I_BIB1","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/0305-0548(94)90083-3","article-title":"The column subtraction algorithm: an exact method for solving weighted set covering, packing and partitioning problems","volume":"21","author":"Harche","year":"1994","journal-title":"Comput. Operat. Res."},{"key":"10.1016\/0167-8191(94)00072-I_BIB2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01407836","article-title":"A parallel algorithm for the 0\u20131 knapsack problem","volume":"21","author":"Loots","year":"1992","journal-title":"Int. J. Parallel Programming"},{"key":"10.1016\/0167-8191(94)00072-I_BIB3","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/358080.358103","article-title":"Anomalies in parallel branch-and-bound algorithms","volume":"27","author":"Lai","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(94)00072-I_BIB4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(93)90050-Q","article-title":"Experiments with parallel branch-and-bound algorithms for the set covering problem","volume":"13","author":"Rushmeier","year":"1993","journal-title":"Operat. Res. Letters"},{"key":"10.1016\/0167-8191(94)00072-I_BIB5","author":"Thinking Machines Corporation","year":"1993","journal-title":"C\u2217 Programming Guide"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919400072I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919400072I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:59:40Z","timestamp":1555570780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919400072I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["016781919400072I"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)00072-i","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}