{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:48:39Z","timestamp":1777128519265,"version":"3.51.4"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T00:00:00Z","timestamp":1499731200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10489-017-0972-6","type":"journal-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T01:54:43Z","timestamp":1499738083000},"page":"357-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":69,"title":["A k-means binarization framework applied to multidimensional knapsack problem"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3126-8352","authenticated-orcid":false,"given":"Jos\u00e9","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,11]]},"reference":[{"issue":"13","key":"972_CR1","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1080\/09500340.2014.920537","volume":"61","author":"M Akhlaghi","year":"2014","unstructured":"Akhlaghi M, Emami F, Nozhat N (2014) Binary tlbo algorithm assisted for designing plasmonic nano bi-pyramids-based absorption coefficient. J Mod Opt 61(13):1092\u20131096","journal-title":"J Mod Opt"},{"issue":"1","key":"972_CR2","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TVCG.2015.2467322","volume":"22","author":"Y Albo","year":"2016","unstructured":"Albo Y, Lanir J, Bak Px, Rafaeli S (2016) Off the radar Comparative evaluation of radial visualization solutions for composite indicators. IEEE Trans Vis Comput Graph 22(1):569\u2013578","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"972_CR3","first-page":"11","volume-title":"XXXII international conference of the Chilean computer science society SCCC, November","author":"J Alegr\u0131a","year":"2014","unstructured":"Alegr\u0131a J, T\u00fapac Y (2014) A generalized quantum-inspired evolutionary algorithm for combinatorial optimization problems XXXII international conference of the Chilean computer science society SCCC, November, pp 11\u201315"},{"key":"972_CR4","doi-asserted-by":"crossref","unstructured":"Alvarez MJ, Shen Y, Giorgi FM, Lachmann A, Belinda Ding B, Hilda Ye B, Califano A (2016) Functional characterization of somatic mutations in cancer using network-based inference of protein activity. Nat Genet","DOI":"10.1038\/ng.3593"},{"issue":"5","key":"972_CR5","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28(5):1130\u20131154","journal-title":"Oper Res"},{"issue":"22","key":"972_CR6","first-page":"11042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218(22):11042\u201311061","journal-title":"Appl Math Comput"},{"issue":"8","key":"972_CR7","doi-asserted-by":"crossref","first-page":"3712","DOI":"10.1016\/j.eswa.2013.11.040","volume":"41","author":"A Baykaso\u0121lu","year":"2014","unstructured":"Baykaso\u0121lu A, Ozsoydan FB (2014) An improved firefly algorithm for solving dynamic multidimensional knapsack problems. Expert Syst Appl 41(8):3712\u20133725","journal-title":"Expert Syst Appl"},{"issue":"11","key":"972_CR8","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) Or-library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"972_CR9","unstructured":"Bhattacharjee KK, Sarmah SP (2016) Modified swarm intelligence based techniques for the knapsack problem. Appl Intell, 1\u201322"},{"key":"972_CR10","volume-title":"Proceedings of congreso latino ibero-americano de investigaci\u00f3n de operaciones e ingenier\u00eda de sistemas","author":"E Chajakis","year":"1992","unstructured":"Chajakis E, Guignard M (1992) A model for delivery of groceries in vehicle with multiple compartments and lagrangean approximation schemes Proceedings of congreso latino ibero-americano de investigaci\u00f3n de operaciones e ingenier\u00eda de sistemas"},{"issue":"1","key":"972_CR11","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ijepes.2012.06.004","volume":"43","author":"K Chandrasekaran","year":"2012","unstructured":"Chandrasekaran K, Simon SP (2012) Network and reliability constrained unit commitment problem using binary real coded firefly algorithm. Int J Electr Power Energy Syst 43(1):921\u2013932","journal-title":"Int J Electr Power Energy Syst"},{"key":"972_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.amc.2013.07.077","volume":"223","author":"C Changdar","year":"2013","unstructured":"Changdar C, Mahapatra GS, Pal RK (2013) An ant colony optimization approach for binary knapsack problem under fuzziness. Appl Math Comput 223:243\u2013253","journal-title":"Appl Math Comput"},{"issue":"3","key":"972_CR13","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1016\/j.asoc.2011.01.002","volume":"11","author":"E Chen","year":"2011","unstructured":"Chen E, Li J, Liu X (2011) In search of the essential binary discrete particle swarm. Appl Soft Comput 11(3):3260\u20133269","journal-title":"Appl Soft Comput"},{"key":"972_CR14","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.asoc.2014.10.030","volume":"26","author":"M Chih","year":"2015","unstructured":"Chih M (2015) Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem. Appl Soft Comput 26:378\u2013389","journal-title":"Appl Soft Comput"},{"issue":"1","key":"972_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4(1):63\u201386","journal-title":"J Heuristics"},{"key":"972_CR16","first-page":"60","volume-title":"2014 9th international conference on software engineering and applications (ICSOFT-EA),","author":"B Crawford","year":"2014","unstructured":"Crawford B, Soto R, Cuesta R, Olivares-Su\u00e1rez M, Johnson F, Olguin E (2014) Two swarm intelligence algorithms for the set covering problem 2014 9th international conference on software engineering and applications (ICSOFT-EA), pp 60\u201369"},{"issue":"3","key":"972_CR17","first-page":"252","volume":"17","author":"B Crawford","year":"2014","unstructured":"Crawford B, Soto R, Olivares-Suarez M, Palma W, Paredes F, Olguin E, Norero E (2014) A binary coded firefly algorithm that solves the set covering problem. Romanian J Inf Sci Technol 17(3):252\u2013264","journal-title":"Romanian J Inf Sci Technol"},{"key":"972_CR18","first-page":"999","volume":"888","author":"S Dey","year":"2015","unstructured":"Dey S, Bhattacharyya S, Maulik U (2015) New quantum inspired meta-heuristic techniques for multi-level colour image thresholding. Appl Soft Comput 888:999","journal-title":"Appl Soft Comput"},{"issue":"1","key":"972_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1162\/EVCO_a_00145","volume":"24","author":"JH Drake","year":"2016","unstructured":"Drake JH, \u00d6zcan E, Burke EK (2016) A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem. Evol Comput 24(1):113\u2013141","journal-title":"Evol Comput"},{"issue":"3","key":"972_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D Fayard","year":"1982","unstructured":"Fayard D, Plateau G (1982) An algorithm for the solution of the 0\u20131 knapsack problem. Computing 28 (3):269\u2013287","journal-title":"Computing"},{"key":"972_CR21","unstructured":"Garc\u00eda J, Crawford B, Soto R, Garc\u00eda P (2017) A multi dynamic binary black hole algorithm applied to set covering problem International conference on harmony search algorithm. Springer, pp 42\u201351"},{"key":"972_CR22","first-page":"215","volume":"31","author":"B Gavish","year":"1982","unstructured":"Gavish B, Pirkul H (1982) Allocation of databases and processors in a distributed computing system. Manag Distributed Data Process 31:215\u2013231","journal-title":"Manag Distributed Data Process"},{"issue":"2","key":"972_CR23","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z Geem","year":"2001","unstructured":"Geem Z, Kim J, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"issue":"4","key":"972_CR24","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1504\/IJBIC.2012.048063","volume":"4","author":"A Gherboudj","year":"2012","unstructured":"Gherboudj A, Layeb A, Chikhi S (2012) Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int J Bio-Inspired Comput 4(4):229\u2013236","journal-title":"Int J Bio-Inspired Comput"},{"issue":"6","key":"972_CR25","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":"972_CR26","unstructured":"Gong T, Tuson AL (2007) Differential evolution for binary encoding Soft computing in industrial applications. Springer, pp 251\u2013262"},{"key":"972_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.engappai.2016.05.006","volume":"55","author":"B Haddar","year":"2016","unstructured":"Haddar B, Khemakhem M, Hanafi S, Wilbaut C (2016) A hybrid quantum particle swarm optimization for the multidimensional knapsack problem. Eng Appl Artif Intell 55:1\u201313","journal-title":"Eng Appl Artif Intell"},{"key":"972_CR28","unstructured":"Hamilton R, Fuller J, Baldwin K, Vespa P, Xiao H, Bergsneider M (2016) Relative position of the third characteristic peak of the intracranial pressure pulse waveform morphology differentiates normal-pressure hydrocephalus shunt responders and nonresponders Intracranial pressure and brain monitoring XV. Springer, pp 339\u2013345"},{"key":"972_CR29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A (2013) Black hole: A new heuristic optimization approach for data clustering. Inf Sci 222:175\u2013184","journal-title":"Inf Sci"},{"key":"972_CR30","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/NABIC.2010.5716320","volume-title":"2010 2nd world congress on nature and biologically inspired computing (naBIC),","author":"AR Hota","year":"2010","unstructured":"Hota AR, Pat A (2010) An adaptive quantum-inspired differential evolution algorithm for 0\u20131 knapsack problem 2010 2nd world congress on nature and biologically inspired computing (naBIC), pp 703\u2013708"},{"key":"972_CR31","first-page":"1","volume-title":"2011 international conference on electrical engineering and informatics (ICEEI),","author":"AA Ibrahim","year":"2011","unstructured":"Ibrahim AA, Mohamed A, Shareef H, Ghoshal SP (2011) An effective power quality monitor placement method utilizing quantum-inspired particle swarm optimization 2011 international conference on electrical engineering and informatics (ICEEI), pp 1\u20136"},{"issue":"2","key":"972_CR32","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1038\/ng.3477","volume":"48","author":"I Ionita-Laza","year":"2016","unstructured":"Ionita-Laza I, McCallum K, Bin X, Buxbaum JD (2016) A spectral approach integrating functional genomic annotations for coding and noncoding variants. Nat Genet 48(2):214\u2013220","journal-title":"Nat Genet"},{"key":"972_CR33","first-page":"4104","volume":"4105","author":"JJ Kennedy","year":"1997","unstructured":"Kennedy JJ, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. IEEE 4105:4104\u20134108","journal-title":"IEEE"},{"key":"972_CR34","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report, Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"key":"972_CR35","doi-asserted-by":"crossref","unstructured":"Khalil T, Youseef H, Aziz M (2006) A binary particle swarm optimization for optimal placement and sizing of capacitor banks in radial distribution feeders with distorted substation voltages. In: Proceedings of AIML international conference, pp 137\u2013143","DOI":"10.21608\/iceeng.2006.33630"},{"key":"972_CR36","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.cor.2015.04.018","volume":"63","author":"X Kong","year":"2015","unstructured":"Kong X, Gao L, Ouyang H, Li S (2015) Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm. Comput Oper Res 63:7\u201322","journal-title":"Comput Oper Res"},{"issue":"3","key":"972_CR37","first-page":"48","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff L (2014) Algorithm selection for combinatorial search problems. Surv AI Mag 35(3):48\u201360","journal-title":"Surv AI Mag"},{"issue":"5","key":"972_CR38","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1504\/IJBIC.2011.042260","volume":"3","author":"A Layeb","year":"2011","unstructured":"Layeb A (2011) A novel quantum inspired cuckoo search for knapsack problems. Int J Bio-Inspired Comput 3(5):297\u2013305","journal-title":"Int J Bio-Inspired Comput"},{"key":"972_CR39","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.cam.2013.04.004","volume":"253","author":"A Layeb","year":"2013","unstructured":"Layeb A (2013) A hybrid quantum inspired harmony search algorithm for 0\u20131 optimization problems. J Comput Appl Math 253:14\u201325","journal-title":"J Comput Appl Math"},{"issue":"5","key":"972_CR40","first-page":"58","volume":"4","author":"A Layeb","year":"2012","unstructured":"Layeb A, Boussalia SR (2012) A novel quantum inspired cuckoo search algorithm for bin packing problem. Int J Inf Technol Comput Sci (IJITCS) 4(5):58","journal-title":"Int J Inf Technol Comput Sci (IJITCS)"},{"issue":"4","key":"972_CR41","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s11721-015-0114-x","volume":"9","author":"BJ Leonard","year":"2015","unstructured":"Leonard BJ, Engelbrecht AP, Cleghorn CW (2015) Critical considerations on angle modulated particle swarm optimisers. Swarm Intell 9(4):291\u2013314","journal-title":"Swarm Intell"},{"issue":"11","key":"972_CR42","first-page":"32","volume":"22","author":"X-L Li","year":"2002","unstructured":"Li X-L, Shao Z-J, Qian J-X (2002) An optimizing method based on autonomous animats: fish-swarm algorithm. Syst Eng Theory Pract 22(11):32\u201338","journal-title":"Syst Eng Theory Pract"},{"key":"972_CR43","doi-asserted-by":"crossref","unstructured":"Liu J, Changzhi W, Cao J, Wang X, Teo KL (2016) A binary differential search algorithm for the 0\u20131 multidimensional knapsack problem. Appl Math Model","DOI":"10.1016\/j.apm.2016.06.002"},{"key":"972_CR44","doi-asserted-by":"crossref","unstructured":"Liu W, Liu L, Cartes D (2007) Angle modulated particle swarm optimization based defensive islanding of large scale power systems. In: IEEE power engineering society conference and exposition in Africa, pp 1\u20138","DOI":"10.1109\/PESAFR.2007.4498114"},{"key":"972_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2015.01.002","volume":"22","author":"Q Long","year":"2015","unstructured":"Long Q, Changzhi W, Huang T, Wang X (2015) A genetic algorithm for unconstrained multi-objective optimization. Swarm Evol Comput 22:1\u201314","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"972_CR46","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","volume":"34","author":"S Martello","year":"1988","unstructured":"Martello S, Toth P (1988) A new algorithm for the 0-1 knapsack problem. Manag Sci 34(5):633\u2013644","journal-title":"Manag Sci"},{"key":"972_CR47","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1111\/j.1540-5915.1973.tb01710.x","volume":"4","author":"C McMillan","year":"1973","unstructured":"McMillan C, Plaine DR (1973) Resource allocation via 0\u20131 programming. Decis Sci 4:119\u2013132","journal-title":"Decis Sci"},{"key":"972_CR48","unstructured":"(2014). IBM IBM ILOG CPLEX Optimizer. http:\/\/www.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/ . Cited on, page 1"},{"issue":"8-9","key":"972_CR49","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s00500-008-0354-4","volume":"13","author":"E \u00d6zcan","year":"2009","unstructured":"\u00d6zcan E, Bas\u0307aran C (2009) A case study of memetic algorithms for constraint optimization. Soft Comput 13(8-9):871\u2013882","journal-title":"Soft Comput"},{"key":"972_CR50","doi-asserted-by":"crossref","unstructured":"Palit S, Sinha SN, Molla MA, Khanra A, Kule M (2011) A cryptanalytic attack on the knapsack cryptosystem using binary firefly algorithm International conference on computer and communication technology (ICCCT), vol 2, pp 428\u2013432","DOI":"10.1109\/ICCCT.2011.6075143"},{"key":"972_CR51","unstructured":"Pampara G (2012) Angle modulated population based algorithms to solve binary problems. Phd thesis, University of Pretoria, Pretoria"},{"key":"972_CR52","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"W-T Pan","year":"2012","unstructured":"Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69\u201374","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"972_CR53","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s10489-015-0730-6","volume":"44","author":"V Pandiri","year":"2016","unstructured":"Pandiri V, Singh A (2016) Swarm intelligence approaches for multidepot salesmen problems with load balancing. Appl Intell 44(4):849\u2013861","journal-title":"Appl Intell"},{"issue":"9","key":"972_CR54","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"CC Petersen","year":"1967","unstructured":"Petersen CC (1967) Computational experience with variants of the balas algorithm applied to the selection of r&d projects. Manag Sci 13(9):736\u2013750","journal-title":"Manag Sci"},{"issue":"2","key":"972_CR55","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul H (1987) A heuristic solution procedure for the multiconstraint zero? One knapsack problem. Nav Res Logist 34(2):161\u2013172","journal-title":"Nav Res Logist"},{"key":"972_CR56","first-page":"207","volume-title":"The 1998 IEEE international conference on evolutionary computation proceedings, 1998. IEEE World Congress on Computational Intelligence,","author":"GR Raidl","year":"1998","unstructured":"Raidl GR (1998) An improved genetic algorithm for the multiconstrained 0-1 knapsack problem The 1998 IEEE international conference on evolutionary computation proceedings, 1998. IEEE World Congress on Computational Intelligence, pp 207\u2013211"},{"issue":"1","key":"972_CR57","first-page":"91","volume":"96","author":"N Rajalakshmi","year":"2015","unstructured":"Rajalakshmi N, Padma Subramanian D, Thamizhavel K (2015) Performance enhancement of radial distributed system with distributed generators by reconfiguration using binary firefly algorithm. J Inst Eng (India): B 96(1):91\u201399","journal-title":"J Inst Eng (India): B"},{"issue":"13","key":"972_CR58","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179 (13):2232\u20132248","journal-title":"Inf Sci"},{"key":"972_CR59","doi-asserted-by":"crossref","unstructured":"Robinson D (2005) Reliability analysis of bulk power systems using swarm intelligence. In: IEEE, pp 96\u2013102","DOI":"10.1109\/RAMS.2005.1408345"},{"issue":"3","key":"972_CR60","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/s00521-014-1743-5","volume":"26","author":"S Saremi","year":"2015","unstructured":"Saremi S, Mirjalili S, Lewis A (2015) How important is a transfer function in discrete heuristic algorithms. Neural Comput Applic 26(3):625\u2013640","journal-title":"Neural Comput Applic"},{"key":"972_CR61","doi-asserted-by":"crossref","unstructured":"Shi Y et al (2001) Particle swarm optimization: developments, applications and resources Proceedings of the 2001 congress on evolutionary computation, 2001, vol 1, pp 81\u201386","DOI":"10.1109\/CEC.2001.934374"},{"issue":"4","key":"972_CR62","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":"972_CR63","first-page":"19","volume":"1","author":"Y Shuyuan","year":"2004","unstructured":"Shuyuan Y, Min W, Licheng J (2004) A quantum particle swarm optimization. IEEE Congress Evol Comput 1:19\u201323","journal-title":"IEEE Congress Evol Comput"},{"key":"972_CR64","doi-asserted-by":"crossref","unstructured":"Simon J, Apte A, Regnier E (2016) An application of the multiple knapsack problem: The self-sufficient marine. Eur J Oper Res","DOI":"10.1016\/j.ejor.2016.06.049"},{"key":"972_CR65","unstructured":"Soto R, Crawford B, Olivares R, Barraza J, Johnson F, Paredes F (2015) A binary cuckoo search algorithm for solving the set covering problem Bioinspired computation in artificial systems. Springer, pp 88\u201397"},{"key":"972_CR66","unstructured":"Swagatam D, Rohan M, Rupam K (2013) Multi-user detection in multi-carrier cdma wireless broadband system using a binary adaptive differential evolution algorithm. In: Proceedings of the 15th annual conference on genetic and evolutionary computation, GECCO, pp 1245\u20131252"},{"key":"972_CR67","doi-asserted-by":"crossref","unstructured":"Thaker NG et al (2016) Radar charts show value of prostate cancer treatment options. Pharmaco Econ Outcomes News 762:33\u201324","DOI":"10.1007\/s40274-016-3409-2"},{"key":"972_CR68","volume-title":"IEEE international conference on evolutionary computations","author":"A Totonchi","year":"2008","unstructured":"Totonchi A, Reza M (2008) Magnetic optimization algorithms, a new synthesis IEEE international conference on evolutionary computations"},{"key":"972_CR69","unstructured":"Wang I, Zhang Y, Zhou Y (2008) Discrete quantum-behaved particle swarm optimization based on estimation of distribution for combinatorial optimization. In: IEEE evolutionary computation, pp 897\u2013904"},{"key":"972_CR70","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.knosys.2013.04.003","volume":"48","author":"L Wang","year":"2013","unstructured":"Wang L, Zheng X-L, Wang S-Y (2013) A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowl-Based Syst 48:17\u201323","journal-title":"Knowl-Based Syst"},{"key":"972_CR71","unstructured":"Weingartner HM (1963) Mathematical programming and the analysis of capital budgeting problems. Markham Pub. Co."},{"issue":"1","key":"972_CR72","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"MH Weingartner","year":"1967","unstructured":"Weingartner MH, Ness DN (1967) Methods for the solution of the multidimensional 0\/1 knapsack problem. Oper Res 15(1):83\u2013103","journal-title":"Oper Res"},{"key":"972_CR73","unstructured":"Yang X-S (2009) Firefly algorithms for multimodal optimization International symposium on stochastic algorithms. Springer, pp 169\u2013178"},{"key":"972_CR74","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, pp 65\u201374"},{"key":"972_CR75","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/NABIC.2009.5393690","volume-title":"World congress on nature & biologically inspired computing, 2009. naBIC 2009,","author":"X-S Yang","year":"2009","unstructured":"Yang X-S, Deb S (2009) Cuckoo search via l\u00e9vy flights World congress on nature & biologically inspired computing, 2009. naBIC 2009, pp 210\u2013214"},{"key":"972_CR76","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/CAC.2013.6775828","volume-title":"Chinese automation congress (CAC), 2013","author":"Y Yang","year":"2013","unstructured":"Yang Y, Yi M, Yang P, Jiang Y (2013) The unit commitment problem based on an improved firefly and particle swarm optimization hybrid algorithm Chinese automation congress (CAC), 2013, pp 718\u2013722"},{"key":"972_CR77","first-page":"3","volume":"456","author":"D Zakaria","year":"2015","unstructured":"Zakaria D, Chaker D (2015) Binary bat algorithm: on the efficiency of mapping functions when handling binary problems using continuous-variable-based metaheuristics. Comput Sci Appl 456:3\u201314","journal-title":"Comput Sci Appl"},{"key":"972_CR78","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.asoc.2015.01.022","volume":"29","author":"B Zhang","year":"2015","unstructured":"Zhang B, Pan Q-K, Zhang X-L, Duan P-Y (2015) An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems. Appl Soft Comput 29: 288\u2013297","journal-title":"Appl Soft Comput"},{"issue":"3","key":"972_CR79","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-010-9136-0","volume":"17","author":"G Zhang","year":"2011","unstructured":"Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heuristics 17 (3):303\u2013351","journal-title":"J Heuristics"},{"key":"972_CR80","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.asoc.2016.02.027","volume":"43","author":"X Zhang","year":"2016","unstructured":"Zhang X, Changzhi W, Li J, Wang X, Yang Z, Lee J-M, Jung K-H (2016) Binary artificial algae algorithm for multidimensional knapsack problems. Appl Soft Comput 43:583\u2013595","journal-title":"Appl Soft Comput"},{"issue":"2","key":"972_CR81","first-page":"112","volume":"10","author":"J Zhao","year":"2005","unstructured":"Zhao J, Sun J, Wenbo X (2005) A binary quantum-behaved particle swarm optimization algorithm with cooperative approach. Int J Comput Sci 10(2):112\u2013118","journal-title":"Int J Comput Sci"},{"key":"972_CR82","unstructured":"Zhifeng W, Houkuan H, Xiang11 Z (2008) A binary-encoding differential evolution algorithm for agent coalition. J Comput Res Dev 5:019"},{"key":"972_CR83","unstructured":"Zhou Y, Bao Z, Luo Q, Zhang S (2016) A complex-valued encoding wind driven optimization for the 0-1 knapsack problem. Appl Intell, 1\u201319"},{"key":"972_CR84","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0-1 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0972-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0972-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0972-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T21:03:29Z","timestamp":1750539809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0972-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,11]]},"references-count":84,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["972"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0972-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,11]]}}}