{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:51:21Z","timestamp":1762102281226,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T00:00:00Z","timestamp":1537142400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T00:00:00Z","timestamp":1537142400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s12351-018-0427-9","type":"journal-article","created":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T02:40:57Z","timestamp":1537152057000},"page":"2555-2581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Weighted superposition attraction algorithm for binary optimization problems"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4952-7239","authenticated-orcid":false,"given":"Adil","family":"Baykaso\u011flu","sequence":"first","affiliation":[]},{"given":"Fehmi Burcin","family":"Ozsoydan","sequence":"additional","affiliation":[]},{"given":"M. Emre","family":"Senol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,17]]},"reference":[{"key":"427_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/A:1018956213524","volume":"86","author":"KS Al-Sultan","year":"1999","unstructured":"Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86:91\u2013103. https:\/\/doi.org\/10.1023\/A:1018956213524","journal-title":"Ann Oper Res"},{"key":"427_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2013.12.015","volume":"169","author":"A Arulselvan","year":"2014","unstructured":"Arulselvan A (2014) A note on the set union knapsack problem. Discrete Appl Math 169:214\u2013218. https:\/\/doi.org\/10.1016\/j.dam.2013.12.015","journal-title":"Discrete Appl Math"},{"issue":"2","key":"427_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01784983","volume":"12","author":"J Barcelo","year":"1990","unstructured":"Barcelo J, Hallefjord \u00c5, Fernandez E, J\u00f6rnsten K (1990) Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. OR Spectrum 12(2):79\u201388. https:\/\/doi.org\/10.1007\/BF01784983","journal-title":"OR Spectrum"},{"issue":"3","key":"427_CR4","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.asoc.2011.11.018","volume":"12","author":"A Baykaso\u011flu","year":"2012","unstructured":"Baykaso\u011flu A (2012) Design optimization with chaos embedded great deluge algorithm. Appl Soft Comput 12(3):1055\u20131067. https:\/\/doi.org\/10.1016\/j.asoc.2011.11.018","journal-title":"Appl Soft Comput"},{"key":"427_CR5","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.asoc.2015.08.052","volume":"37","author":"A Baykaso\u011flu","year":"2015","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2015) Weighted superposition attraction (WSA): a swarm intelligence algorithm for optimization problems\u2014part 2: constrained optimization. Appl Soft Comput 37:396\u2013415. https:\/\/doi.org\/10.1016\/j.asoc.2015.08.052","journal-title":"Appl Soft Comput"},{"key":"427_CR6","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.asoc.2015.10.036","volume":"56","author":"A Baykaso\u011flu","year":"2017","unstructured":"Baykaso\u011flu A, Akpinar \u015e (2017) Weighted Superposition Attraction (WSA): a swarm intelligence algorithm for optimization problems\u2014part 1: unconstrained optimization. Appl Soft Comput 56:520\u2013540. https:\/\/doi.org\/10.1016\/j.asoc.2015.10.036","journal-title":"Appl Soft Comput"},{"key":"427_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.asoc.2015.06.056","volume":"36","author":"A Baykaso\u011flu","year":"2015","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2015) Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl Soft Comput 36:152\u2013164. https:\/\/doi.org\/10.1016\/j.asoc.2015.06.056","journal-title":"Appl Soft Comput"},{"key":"427_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.eswa.2017.11.048","volume":"96","author":"A Baykaso\u011flu","year":"2018","unstructured":"Baykaso\u011flu A, Ozsoydan FB (2018) Dynamic optimization in binary search spaces via weighted superposition attraction algorithm. Expert Syst Appl 96:157\u2013174. https:\/\/doi.org\/10.1016\/j.eswa.2017.11.048","journal-title":"Expert Syst Appl"},{"key":"427_CR9","unstructured":"Baykaso\u011flu A, \u015eenol ME (2016a) Combinatorial optimization via weighted superposition attraction. In: International conference on operations research of the GOR, OR 2016, Hamburg"},{"key":"427_CR10","unstructured":"Baykaso\u011flu A, \u015eenol ME (2016b) Oppositon-based weighted superposition attraction algorithm for travelling salesman problems. In: Lm-Scm 2016 Xiv. International Logistics and Supply Chain Congress, Izmir, Turkey"},{"key":"427_CR11","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput 19:252\u2013263. https:\/\/doi.org\/10.1016\/j.asoc.2014.02.010","journal-title":"Appl Soft Comput"},{"issue":"1","key":"427_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10489-016-0822-y","volume":"46","author":"KK Bhattacharjee","year":"2017","unstructured":"Bhattacharjee KK, Sarmah SP (2017) Modified swarm intelligence based techniques for the knapsack problem. Appl Intell 46(1):158\u2013179. https:\/\/doi.org\/10.1007\/s10489-016-0822-y","journal-title":"Appl Intell"},{"key":"427_CR13","volume-title":"Discrete location theory","author":"ML Cornuejols","year":"1990","unstructured":"Cornuejols ML, Nemhauser GL, Wolsey LA (1990) The uncapacitated facility location problem. In: Francis RL, Mirchandani P (eds) Discrete location theory. Wiley Interscience, New York"},{"key":"427_CR14","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-016-0155-6","author":"J de Armas","year":"2017","unstructured":"de Armas J, Juan AA, Marqu\u00e8s JM, Pedroso JP (2017) Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic. J Oper Res Soc. https:\/\/doi.org\/10.1057\/s41274-016-0155-6","journal-title":"J Oper Res Soc"},{"key":"427_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cor.2016.11.015","volume":"80","author":"F Della Croce","year":"2017","unstructured":"Della Croce F, Salassa F, Scatamacchia R (2017a) An exact approach for the 0\u20131 knapsack problem with setups. Comput Oper Res 80:61\u201367. https:\/\/doi.org\/10.1016\/j.cor.2016.11.015","journal-title":"Comput Oper Res"},{"issue":"1","key":"427_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ejor.2016.12.009","volume":"260","author":"F Della Croce","year":"2017","unstructured":"Della Croce F, Salassa F, Scatamacchia R (2017b) A new exact approach for the 0\u20131 collapsing knapsack problem. Eur J Oper Res 260(1):56\u201369. https:\/\/doi.org\/10.1016\/j.ejor.2016.12.009","journal-title":"Eur J Oper Res"},{"issue":"3","key":"427_CR17","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1007\/s10586-017-0900-x","volume":"20","author":"MH Diallo","year":"2017","unstructured":"Diallo MH, August M, Hallman R, Kline M, Slayback SM, Graves C (2017) AutoMigrate: a framework for developing intelligent, self-managing cloud services with maximum availability. Clust Comput 20(3):1995\u20132012. https:\/\/doi.org\/10.1007\/s10586-017-0900-x","journal-title":"Clust Comput"},{"key":"427_CR18","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Politecnico di Milano, Italy, (Technical Report No: 91-016)"},{"issue":"9\/10","key":"427_CR19","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1108\/K-09-2013-0201","volume":"43","author":"JH Drake","year":"2014","unstructured":"Drake JH, Hyde M, Ibrahim K, Ozcan E (2014) A genetic programming hyper-heuristic for the multidimensional knapsack problem. Kybernetes 43(9\/10):1500\u20131511. https:\/\/doi.org\/10.1108\/K-09-2013-0201","journal-title":"Kybernetes"},{"issue":"6","key":"427_CR20","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D Erlenkotter","year":"1978","unstructured":"Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6):992\u20131009. https:\/\/doi.org\/10.1287\/opre.26.6.992","journal-title":"Oper Res"},{"issue":"7","key":"427_CR21","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2017","unstructured":"Feng Y, Wang GG, Deb S, Lu M, Zhao XJ (2017) Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28(7):1619\u20131634. https:\/\/doi.org\/10.1007\/s00521-015-2135-1","journal-title":"Neural Comput Appl"},{"issue":"6","key":"427_CR22","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","volume":"41","author":"O Goldschmidt","year":"1994","unstructured":"Goldschmidt O, Nehme D, Yu G (1994) Note: on the set-union knapsack problem. Naval Res Log 41(6):833\u2013842. https:\/\/doi.org\/10.1002\/1520-6750(199410)41:6%3c833:AID-NAV3220410611%3e3.0.CO;2-Q","journal-title":"Naval Res Log"},{"key":"427_CR23","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/861512","author":"AR Guner","year":"2008","unstructured":"Guner AR, Sevkli M (2008) A discrete particle swarm optimization algorithm for uncapacitated facility location problem. J Artif Evol Appl. https:\/\/doi.org\/10.1155\/2008\/861512","journal-title":"J Artif Evol Appl"},{"issue":"1","key":"427_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"TS Hale","year":"2003","unstructured":"Hale TS, Moberg CR (2003) Location science research: a review. Ann Oper Res 123(1):21\u201335. https:\/\/doi.org\/10.1023\/A:1026110926707","journal-title":"Ann Oper Res"},{"key":"427_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.future.2017.05.044","volume":"78","author":"Y He","year":"2018","unstructured":"He Y, Xie H, Wong TL, Wang X (2018) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Future Gener Comput Syst 78:77\u201386. https:\/\/doi.org\/10.1016\/j.future.2017.05.044","journal-title":"Future Gener Comput Syst"},{"key":"427_CR26","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"issue":"1","key":"427_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0377-2217(98)00039-3","volume":"114","author":"K Holmberg","year":"1999","unstructured":"Holmberg K (1999) Exact solution methods for uncapacitated location problems with convex transportation costs. Eur J Oper Res 114(1):127\u2013140. https:\/\/doi.org\/10.1016\/S0377-2217(98)00039-3","journal-title":"Eur J Oper Res"},{"issue":"6","key":"427_CR28","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761\u2013779. https:\/\/doi.org\/10.1016\/S0305-0548(01)00021-1","journal-title":"Comput Oper Res"},{"key":"427_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"427_CR30","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, 4, 1942\u20131948, Perth, WA, Australia. https:\/\/doi.org\/10.1109\/icnn.1995.488968","DOI":"10.1109\/icnn.1995.488968"},{"key":"427_CR31","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.asoc.2015.04.007","volume":"33","author":"MS Kiran","year":"2015","unstructured":"Kiran MS (2015) The continuous artificial bee colony algorithm for binary optimization. Appl Soft Comput 33:15\u201323. https:\/\/doi.org\/10.1016\/j.asoc.2015.04.007","journal-title":"Appl Soft Comput"},{"key":"427_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-13111-5","volume-title":"Location science","author":"G Laporte","year":"2015","unstructured":"Laporte G, Nickel S, da Gama FS (2015) Location science. Springer, Berlin"},{"key":"427_CR33","doi-asserted-by":"publisher","unstructured":"Li ZK, Li N (2009) A novel multi-mutation binary particle swarm optimization for 0\/1 knapsack problem. In: Proceedings of IEEE control and decision conference, 3042\u20133047, Guilin, China. https:\/\/doi.org\/10.1109\/ccdc.2009.5192838","DOI":"10.1109\/ccdc.2009.5192838"},{"issue":"1","key":"427_CR34","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ejor.2006.12.046","volume":"185","author":"FT Lin","year":"2008","unstructured":"Lin FT (2008) Solving the knapsack problem with imprecise weight coefficients using genetic algorithms. Eur J Oper Res 185(1):133\u2013145. https:\/\/doi.org\/10.1016\/j.ejor.2006.12.046","journal-title":"Eur J Oper Res"},{"key":"427_CR35","unstructured":"Lister W, Laycock RG, Day AM (2010) A dynamic cache for real-time crowd rendering. In: Computer graphics forum"},{"key":"427_CR36","doi-asserted-by":"publisher","unstructured":"Liu Y, Liu C (2009) A schema-guiding evolutionary algorithm for 0\u20131 knapsack problem. In: Proceedings of IEEE computer science and information technology\u2014spring conference, 160\u2013164, Singapore, Singapore. https:\/\/doi.org\/10.1109\/iacsit-sc.2009.31","DOI":"10.1109\/iacsit-sc.2009.31"},{"issue":"2017","key":"427_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2017.05.023","volume":"130","author":"L \u00d6zbak\u0131r","year":"2017","unstructured":"\u00d6zbak\u0131r L, Turna F (2017) Clustering performance comparison of new generation meta-heuristic algorithms. Knowl-Based Syst 130(2017):1\u201316. https:\/\/doi.org\/10.1016\/j.knosys.2017.05.023","journal-title":"Knowl-Based Syst"},{"key":"427_CR38","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2014.10.060","volume":"297","author":"C Ozturk","year":"2015","unstructured":"Ozturk C, Hancer E, Karaboga D (2015) A novel binary artificial bee colony algorithm based on genetic operators. Inf Sci 297:154\u2013170. https:\/\/doi.org\/10.1016\/j.ins.2014.10.060","journal-title":"Inf Sci"},{"issue":"3","key":"427_CR39","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2016.10.054","volume":"258","author":"D Pisinger","year":"2017","unstructured":"Pisinger D, Saidi A (2017) Tolerance analysis for 0\u20131 knapsack problems. Eur J Oper Res 258(3):866\u2013876. https:\/\/doi.org\/10.1016\/j.ejor.2016.10.054","journal-title":"Eur J Oper Res"},{"issue":"8","key":"427_CR40","doi-asserted-by":"publisher","first-page":"5508","DOI":"10.1016\/j.asoc.2011.05.008","volume":"11","author":"R Rajabioun","year":"2011","unstructured":"Rajabioun R (2011) Cuckoo optimization algorithm. Appl Soft Comput 11(8):5508\u20135518. https:\/\/doi.org\/10.1016\/j.asoc.2011.05.008","journal-title":"Appl Soft Comput"},{"key":"427_CR41","doi-asserted-by":"publisher","unstructured":"Riondato M, Vandin F (2014) Finding the true frequent itemsets. In: Proceedings of the 2014 SIAM international conference on data mining (pp 497\u2013505). Society for Industrial and Applied Mathematics. https:\/\/doi.org\/10.1137\/1.9781611973440.57","DOI":"10.1137\/1.9781611973440.57"},{"issue":"8","key":"427_CR42","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.cor.2005.09.005","volume":"34","author":"G \u015eahin","year":"2007","unstructured":"\u015eahin G, S\u00fcral H (2007) A review of hierarchical facility location models. Comput Oper Res 34(8):2310\u20132331. https:\/\/doi.org\/10.1016\/j.cor.2005.09.005","journal-title":"Comput Oper Res"},{"key":"427_CR43","doi-asserted-by":"publisher","unstructured":"Sevkli M, Guner A (2006) A continuous particle swarm optimization algorithm for uncapacitated facility location problem. In: Ant colony optimization and swarm intelligence, 316\u2013323. https:\/\/doi.org\/10.1007\/11839088_28","DOI":"10.1007\/11839088_28"},{"issue":"2","key":"427_CR44","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1108\/17563780810874717","volume":"1","author":"H Shah-Hosseini","year":"2008","unstructured":"Shah-Hosseini H (2008) Intelligent water drops algorithm: a new optimization method for solving the multiple knapsack problem. Int J Intell Comput Cybern 1(2):193\u2013212. https:\/\/doi.org\/10.1108\/17563780810874717","journal-title":"Int J Intell Comput Cybern"},{"key":"427_CR45","doi-asserted-by":"publisher","unstructured":"Shi H (2006). Solution to 0\/1 knapsack problem based on improved ant colony algorithm. In: Proceedings of IEEE international conference on information acquisition, 1062\u20131066, Weihai, China. https:\/\/doi.org\/10.1109\/icia.2006.305887","DOI":"10.1109\/icia.2006.305887"},{"issue":"4","key":"427_CR46","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Glob Optim"},{"key":"427_CR47","doi-asserted-by":"publisher","unstructured":"Su L, Zhou Y (2016) Tolerating correlated failures in massively parallel stream processing engines. In: Proceedings of IEEE conference in data engineering (ICDE), 517\u2013528, Helsinki, Finland. https:\/\/doi.org\/10.1109\/icde.2016.7498267","DOI":"10.1109\/icde.2016.7498267"},{"issue":"9","key":"427_CR48","doi-asserted-by":"publisher","first-page":"2563","DOI":"10.1016\/j.cor.2005.07.014","volume":"33","author":"M Sun","year":"2006","unstructured":"Sun M (2006) Solving the uncapacitated facility location problem using tabu search. Comput Oper Res 33(9):2563\u20132589. https:\/\/doi.org\/10.1016\/j.cor.2005.07.014","journal-title":"Comput Oper Res"},{"key":"427_CR49","unstructured":"Taylor R (2016) Approximations of the densest k-subhypergraph and set union knapsack problems. arXiv:1610.04935"},{"issue":"4","key":"427_CR50","doi-asserted-by":"publisher","first-page":"3201","DOI":"10.3233\/JIFS-169263","volume":"32","author":"K Tsuya","year":"2017","unstructured":"Tsuya K, Takaya M, Yamamura A (2017) Application of the firefly algorithm to the uncapacitated facility location problem. J Intell Fuzzy Syst 32(4):3201\u20133208. https:\/\/doi.org\/10.3233\/JIFS-169263","journal-title":"J Intell Fuzzy Syst"},{"key":"427_CR51","doi-asserted-by":"publisher","unstructured":"Wang D, Wu CH, Ip A, Wang D, Yan Y (2008) Parallel multi-population particle swarm optimization algorithm for the uncapacitated facility location problem using openMP. In: Proceedings of IEEE world congress on computational intelligence, 1214\u20131218, Hong Kong, China. https:\/\/doi.org\/10.1109\/cec.2008.4630951","DOI":"10.1109\/cec.2008.4630951"},{"key":"427_CR52","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press"},{"key":"427_CR53","doi-asserted-by":"publisher","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez J, Pelta D, Cruz C, Terrazas G, Krasnogor N (eds) Nature inspired cooperative strategies for optimization. Springer, Berlin. pp 65\u201374. https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6","DOI":"10.1007\/978-3-642-12538-6_6"},{"issue":"2","key":"427_CR54","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11063-015-9465-y","volume":"44","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Li L, Ma M (2016) A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem. Neural Process Lett 44(2):407\u2013430. https:\/\/doi.org\/10.1007\/s11063-015-9465-y","journal-title":"Neural Process Lett"},{"issue":"3","key":"427_CR55","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Bao Z, Luo Q, Zhang S (2017) A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl Intell 46(3):684\u2013702. https:\/\/doi.org\/10.1007\/s10489-016-0855-2","journal-title":"Appl Intell"},{"issue":"2","key":"427_CR56","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556\u20131564. https:\/\/doi.org\/10.1016\/j.asoc.2010.07.019","journal-title":"Appl Soft Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0427-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0427-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0427-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T04:39:28Z","timestamp":1693888768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0427-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,17]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0427-9","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2018,9,17]]},"assertion":[{"value":"27 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}