{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:06:57Z","timestamp":1759133217816},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1016\/s0377-2217(99)00287-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"166-174","source":"Crossref","is-referenced-by-count":11,"title":["Design of parallel algorithms for the single resource allocation problem"],"prefix":"10.1016","volume":"126","author":[{"given":"D","family":"Morales","sequence":"first","affiliation":[]},{"given":"F","family":"Almeida","sequence":"additional","affiliation":[]},{"given":"F","family":"Garc\u0131\u0301a","sequence":"additional","affiliation":[]},{"given":"J.L","family":"Roda","sequence":"additional","affiliation":[]},{"given":"C","family":"Rodr\u0131\u0301guez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00287-8_BIB1","unstructured":"V. Aleksandrov, Dynamic Programming Approach of the Knapsack Problems for the Ring of Processors, WPDP93, Sofia, Bulgaria, 1993"},{"issue":"3\/4","key":"10.1016\/S0377-2217(99)00287-8_BIB2","article-title":"A parallel algorithm for the integer knapsack problem for pipeline networks","volume":"6","author":"Almeida","year":"1994","journal-title":"Journal of Parallel Algorithms Applications"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB3","unstructured":"F. Almeida, F. Garcia, J. Roda, D. Morales, C. Rodriguez, A comparative study of two distributed systems: PVM and transputers, in: Transputers Applications and Systems '95, IOS Press, Ohmsha, UK, 1995, pp. 244\u2013258"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB4","unstructured":"Andonov, Raimbault, Quinton, Dynamic programming parallel implementations for the knapsack problem, Technical Report 740, IRISA, June 1993"},{"issue":"2","key":"10.1016\/S0377-2217(99)00287-8_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/cpe.4330060205","article-title":"Do hypercubes sort faster than tree machines?","volume":"6","author":"Brinch","year":"1994","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB6","unstructured":"M. Capel, A. Palma, A programming tool for distributed implementation of branch-and-bound algorithms, in: Parallel Computing and Transputer Applications, CIMNE, IOS Press, Barcelona, 1992, pp. 138\u2013147"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB7","unstructured":"F. Garc\u0131\u0301a, Programaci\u00f3n en Paralelo y T\u00e9cnicas Algor\u0131\u0301tmicas, Ph.D. Thesis, DEIOC, La Laguna University, 1995"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB8","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB9","unstructured":"T. Ibaraki, Enumerative Approaches to Combinatorial Optimization, Part II, Annals Operations Research 11(1\u20134) (1988)"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB10","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0743-7315(88)90007-X","article-title":"A hypercube algorithm for the 0\/1 knapsack problem","volume":"5","author":"Lee","year":"1988","journal-title":"Journal of Parallel Distributed Computing"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB11","doi-asserted-by":"crossref","unstructured":"R. L\u00fcling, B. Monien, Two strategies for solving the vertex cover problem on a transputer network, in: Proceedings of the Third International Workshop on Distributed Algorithms, LNCS392, 1991, pp. 160\u2013171","DOI":"10.1007\/3-540-51687-5_40"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB12","unstructured":"G. Mckeown, V. Rayward-Smith, A. Rush, H. Turpin, Using a transputer network to solve branch-and-bound problems, in: Proceedings of the TRANSPUTING '91 Conference, IOS Press, 1991, pp. 781\u2013800"},{"issue":"1","key":"10.1016\/S0377-2217(99)00287-8_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","article-title":"Partitioning and mapping algorithms into fixed size systolic arrays","volume":"35","author":"Moldovan","year":"1986","journal-title":"IEEE Transactions on Computing C"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB14","doi-asserted-by":"crossref","unstructured":"D. Morales, J. Roda, F. Almeida, C. Rodr\u0131\u0301guez, F. Garc\u0131\u0301a, Integral knapsack problems: parallel algorithms and their implementations on distributed systems, in: Proceedings of the 1995 International Conference on Supercomputing, ACM, New York, 1995","DOI":"10.1145\/224538.224564"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB15","unstructured":"C. Rodr\u0131\u0301guez, F. Garc\u0131\u0301a, C. Le\u00f3n, F. Almeida, A parallelization of a branch and bound algorithm for the set covering problem, in: Proceedings of the Sixth Meeting of the EURO Working Group on Location Analysis, 1992, pp. 183\u2013193"},{"key":"10.1016\/S0377-2217(99)00287-8_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-8191(89)90069-0","article-title":"A study of parallel branch-and-bound algorithms with best-bound-first search","volume":"11","author":"Troya","year":"1989","journal-title":"Parallel Computing"},{"issue":"6","key":"10.1016\/S0377-2217(99)00287-8_BIB17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/MC.1985.1662926","article-title":"Multiprocessing of combinatorial search problems","volume":"18","author":"Wah","year":"1985","journal-title":"Computer"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002878?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002878?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:21:18Z","timestamp":1578698478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0377221799002878"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00287-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}