{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:13:14Z","timestamp":1648696394561},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,7]],"date-time":"2013-04-07T00:00:00Z","timestamp":1365292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00500-013-1041-7","type":"journal-article","created":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T11:26:32Z","timestamp":1365247592000},"page":"125-142","source":"Crossref","is-referenced-by-count":3,"title":["Systolic neighborhood search on graphics processing units"],"prefix":"10.1007","volume":"18","author":[{"given":"Pablo","family":"Vidal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Luna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,7]]},"reference":[{"key":"1041_CR2","doi-asserted-by":"crossref","unstructured":"Alba E (2005) Parallel metaheuristics: a new class of algorithms. Wiley-Interscience, New York","DOI":"10.1002\/0471739383"},{"key":"1041_CR3","doi-asserted-by":"crossref","unstructured":"Alba E, Dorronsoro B (2008) Cellular genetic algorithms, operations research\/computer science interfaces, vol 42. Springer, Heidelberg","DOI":"10.1007\/978-0-387-77610-1_1"},{"key":"1041_CR4","unstructured":"Alba E, Vidal P (2011) Systolic optimization on gpu platforms. In: EUROCAST (1), pp 375\u2013383"},{"key":"1041_CR5","doi-asserted-by":"crossref","unstructured":"Chan H, Mazumder P (1995) A systolic architecture for high speed hypergraph partitioning using a genetic algorithm. In: Yao X (ed) Progress in evolutionary computation, lecture notes in computer science, vol 956. Springer, Berlin, pp 109\u2013126","DOI":"10.1007\/3-540-60154-6_51"},{"key":"1041_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P Chu","year":"1998","unstructured":"Chu P, Beasley J (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"key":"1041_CR1","unstructured":"CUDA\u00a0(2007) NVIDIA CUDA Compute Unified Device Architecture\u2014Programming Guide"},{"key":"1041_CR7","doi-asserted-by":"crossref","unstructured":"Gavish B, Pirkul H (1986) Computer and database location in distributed computer systems. IEEE Trans Comput 35(7):583\u2013590","DOI":"10.1109\/TC.1986.1676799"},{"issue":"6","key":"1041_CR8","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"PC Gilmore","year":"1966","unstructured":"Gilmore PC, Gomory RE (1966) The theory and computation of knapsack functions. Oper Res 14(6):1045\u20131074","journal-title":"Oper Res"},{"key":"1041_CR9","unstructured":"Glover F, Kochenberger GA (1996) Critical event tabu search for multidimensional knapsack problems. metaheuristics: the theory and applications. Kluwer Academic Publishers, Boston, pp 407\u2013427"},{"key":"1041_CR10","doi-asserted-by":"crossref","unstructured":"Gottlieb J (2001) On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems. In: Applications of evolutionary computing, lecture notes in computer science, pp 50\u201359","DOI":"10.1007\/3-540-45365-2_6"},{"key":"1041_CR11","unstructured":"Grama A, Karypis G, Kumar V, Gupta A (2003) Introduction to parallel computing, 2nd edn. Addison Wesley, Pearson"},{"issue":"1","key":"1041_CR12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ejor.2008.01.044","volume":"195","author":"CWS Hanafi","year":"2009","unstructured":"Hanafi CWS (2009) New convergent heuristics for 0-1 mixed integer programming. Eur J Oper Res 195(1):62\u201374","journal-title":"Eur J Oper Res"},{"key":"1041_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-009-0546-z","volume":"183","author":"S Hanafi","year":"2011","unstructured":"Hanafi S, Wilbaut C (2011) Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Ann Oper Res 183:125\u2013142","journal-title":"Ann Oper Res"},{"key":"1041_CR14","unstructured":"Hwang J, Park S, Kong IY (2011) An integer programming-based local search for large-scale multidimensional knapsack problems. Int J Comput Sci Eng 3(6):2257\u20132264"},{"key":"1041_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10732-008-9087-x","volume":"16","author":"L Ke","year":"2010","unstructured":"Ke L, Feng Z, Ren Z, Wei X (2010) An ant colony optimization approach for the multidimensional knapsack problem. J Heuristics 16:65\u201383","journal-title":"J Heuristics"},{"key":"1041_CR16","unstructured":"Kung HT (1979) Let\u2019s design algorithms for vlsi systems. In: Proceedings of the conference on very large scale integration: architecture, design, fabrication, pp 65\u201390"},{"key":"1041_CR17","doi-asserted-by":"crossref","unstructured":"Lagae A, Lefebvre S, Drettakis G, Dutr\u00e9 P (2009) Procedural noise using sparse Gabor convolution. ACM Trans Graph (Proceedings of ACM SIGGRAPH 2009) 28(3):54:1\u201354:10","DOI":"10.1145\/1576246.1531360"},{"key":"1041_CR18","doi-asserted-by":"crossref","unstructured":"Megson G, Bland I (1998) Synthesis of a systolic array genetic algorithm. In: Parallel processing symposium, 1998. IPPS\/SPDP 1998","DOI":"10.1109\/IPPS.1998.669933"},{"issue":"4","key":"1041_CR19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W Shih","year":"1979","unstructured":"Shih W (1979) A branch and bound method for the multiconstraint zero one knapsack problem. J Oper Res Soc 30(4):369\u2013378","journal-title":"J Oper Res Soc"},{"key":"1041_CR20","doi-asserted-by":"crossref","unstructured":"Thomas DB, Howes L, Luk W (2009) A comparison of CPUs, GPUs, FPGAs, and massively parallel processor arrays for random number generation. In: Symposium on Field Programmable Gate Arrays, pp 63\u201372","DOI":"10.1145\/1508128.1508139"},{"key":"1041_CR21","unstructured":"Vasquez M, Hao JK (2001) A hybrid approach for the 01 multidimensional knapsack problem. In: In Proceedings of the international joint conference on artificial intelligence 2001, pp 328\u2013333"},{"key":"1041_CR22","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M Vasquez","year":"2005","unstructured":"Vasquez M, Vimont Y (2005) Improved results on the 0-1 multidimensional knapsack problem. Eur J Oper Res 165:70\u201381","journal-title":"Eur J Oper Res"},{"key":"1041_CR23","doi-asserted-by":"crossref","unstructured":"Zhang X, Liu Z, Bai Q (2012) A new hybrid algorithm for the multidimensional knapsack problem. In: Bio-inspired computing and applications, lecture notes in computer science, pp 191\u2013198","DOI":"10.1007\/978-3-642-24553-4_27"},{"key":"1041_CR24","doi-asserted-by":"crossref","unstructured":"Zhou Q, Luo W (2010) A novel multi-population genetic algorithm for multiple-choice multidimensional knapsack problems. In: Cai Z, Hu C, Kang Z, Liu Y (eds) Advances in computation and intelligence, lecture notes in computer science, vol 6382. Springer, Berlin, pp 148\u2013157","DOI":"10.1007\/978-3-642-16493-4_16"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1041-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1041-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1041-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T00:58:22Z","timestamp":1595638702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1041-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,7]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1041"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1041-7","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,7]]}}}