{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:27:56Z","timestamp":1778646476503,"version":"3.51.4"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T00:00:00Z","timestamp":1355443200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10898-012-0006-1","type":"journal-article","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T08:34:29Z","timestamp":1355387669000},"page":"549-573","source":"Crossref","is-referenced-by-count":33,"title":["Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems"],"prefix":"10.1007","volume":"57","author":[{"given":"Zahra","family":"Beheshti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siti Mariyam","family":"Shamsuddin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siti Sophiayati","family":"Yuhaniz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,14]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1997","unstructured":"Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A.: Combinatorial Optimization. Springer, Berlin (1997)"},{"key":"6_CR2","volume-title":"Foundations of Algorithms Using C++ Pseudo Code","author":"R. Neapolitan","year":"2004","unstructured":"Neapolitan R., Naimipour K.: Foundations of Algorithms Using C++ Pseudo Code, 3rd edn. Jones and Bartlett, Massachusetts (2004)","edition":"3"},{"issue":"1","key":"6_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu P.C., Beasley J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4(1), 63\u201386 (1998)","journal-title":"J. Heuristics"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"L.V. Snyder","year":"2006","unstructured":"Snyder L.V., Daskin M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. Eur. J. Oper. Res. 174, 38\u201353 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR5","first-page":"483","volume":"24","author":"D. Din","year":"2008","unstructured":"Din D.: Heuristic and simulated annealing algorithms for wireless ATM backbone network design problem. J. Inf. Sci. Eng. 24, 483\u2013501 (2008)","journal-title":"J. Inf. Sci. Eng."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1016\/j.mcm.2008.01.002","volume":"48","author":"M. Andresen","year":"2008","unstructured":"Andresen M., Br\u00e4sel H., M\u00f6rig M., Tusch J., Werner F., Willenius P.: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Math. Comput. Model. 48, 1279\u20131293 (2008)","journal-title":"Math. Comput. Model."},{"issue":"6","key":"6_CR7","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","volume":"20","author":"O. Engin","year":"2004","unstructured":"Engin O., D\u00f6yen A.: A new approach to solve hybrid flowshop scheduling problems by artificial immune system. Future Gener. Comput. Syst. 20(6), 1083\u20131095 (2004)","journal-title":"Future Gener. Comput. Syst."},{"key":"6_CR8","first-page":"527","volume":"36","author":"W. Du","year":"2009","unstructured":"Du W., Du H., Li M.: Hyper-mutation antibody clone algorithms for TSP. J. Xidian Univ. 36, 527\u2013534 (2009)","journal-title":"J. Xidian Univ."},{"issue":"8","key":"6_CR9","doi-asserted-by":"crossref","first-page":"2672","DOI":"10.1016\/j.cor.2006.12.029","volume":"35","author":"M. Kong","year":"2008","unstructured":"Kong M., Tian P., Kao Y.C.: A new ant colony optimization algorithm for the multidimensional Knapsack problem. Comput. Oper. Res. 35(8), 2672\u20132683 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"6_CR10","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/j.pnsc.2008.03.028","volume":"18","author":"J. Yang","year":"2008","unstructured":"Yang J., Shi X., Marchese M., Liang Y.: An ant colony optimization method for generalized TSP problem. Prog. Nat. Sci. 18(11), 1417\u20131422 (2008)","journal-title":"Prog. Nat. Sci."},{"issue":"2","key":"6_CR11","first-page":"11","volume":"34","author":"S. Labed","year":"2011","unstructured":"Labed S., Gherboudj A., Chikhi S.: A modified hybrid particle swarm optimization algorithm for multidimensional knapsack problem. Int. J. Comput. Appl. 34(2), 11\u201316 (2011)","journal-title":"Int. J. Comput. Appl."},{"issue":"5","key":"6_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"X.H. Shi","year":"2007","unstructured":"Shi X.H., Liang Y.C., Lee H.P., Lu C., Wang Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"6_CR13","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1007\/s10732-010-9150-2","volume":"17","author":"K. Fadlaoui","year":"2011","unstructured":"Fadlaoui K., Galinier P.: A tabu search algorithm for the covering design problem. J. Heuristics 17(6), 659\u2013674 (2011)","journal-title":"J. Heuristics"},{"issue":"3","key":"6_CR14","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/TSMCA.2009.2014556","volume":"39","author":"T. James","year":"2009","unstructured":"James T., Rego C., Glover F.: Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A 39(3), 579\u2013596 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1080\/00207540802555744","volume":"48","author":"W. Zhu","year":"2009","unstructured":"Zhu W., Curry J., Marquez A.: SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration. Int. J. Prod. Res. 48, 1035\u20131047 (2009)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"6_CR16","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/72.623217","volume":"8","author":"Y. Leung","year":"1997","unstructured":"Leung Y., Gao Y., Xu Z.B.: Degree of population diversity\u2014a perspective on premature convergence in genetic algorithms and its Markov chain analysis. IEEE Trans. Neural Netw. 8(5), 1165\u20131176 (1997)","journal-title":"IEEE Trans. Neural Netw."},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0965-9978(03)00113-3","volume":"35","author":"O. Hrstka","year":"2004","unstructured":"Hrstka O., Ku\u010derov\u00e1 A.: Improvements of real coded genetic algorithms based on differential operators preventing premature convergence. Adv. Eng. Softw. 35, 237\u2013246 (2004)","journal-title":"Adv. Eng. Softw."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s00170-011-3614-x","volume":"60","author":"G. Moslemipour","year":"2012","unstructured":"Moslemipour G., Lee T.S., Rilling D.: A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems. Int. J. Adv. Manuf. Technol. 60, 11\u201327 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"11","key":"6_CR19","doi-asserted-by":"crossref","first-page":"4316","DOI":"10.1016\/j.cnsns.2012.03.015","volume":"17","author":"W.F. Gao","year":"2012","unstructured":"Gao W.F., Liu S.Y., Huang L.L.: Particle swarm optimization with chaotic opposition based population initialization and stochastic search technique. Commun. Nonlinear Sci. Numer. Simul. 17(11), 4316\u20134327 (2012)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"issue":"3","key":"6_CR20","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2004.826074","volume":"8","author":"R. Mendes","year":"2004","unstructured":"Mendes R., Kennedy J., Neves J.: The fully informed particle swarm: simpler maybe better. IEEE Trans. Evol. Comput. 8(3), 204\u2013210 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"6_CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"J.J. Liang","year":"2006","unstructured":"Liang J.J., Qin A.K., Suganthan P.N., Baskar S.: comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10(3), 281\u2013295 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"6_CR22","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/TSMCB.2009.2015956","volume":"39","author":"Z.H. Zhan","year":"2009","unstructured":"Zhan Z.H., Zhang J., Li Y., Chung H.S.: Adaptive particle swarm optimization. IEEE Trans. Syst. Man Cybern. Part B 39(6), 1362\u20131381 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"6_CR23","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H Holland","year":"1975","unstructured":"Holland J.H: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, Michigan (1975)"},{"issue":"2","key":"6_CR24","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TASE.2009.2019265","volume":"7","author":"H.C.W. Lau","year":"2010","unstructured":"Lau H.C.W., Chan T.M., Tsui W.T., Pang W.K.: Application of genetic algorithms to solve the multidepot vehicle routing problem. IEEE Trans. Autom. Sci. Eng. 7(2), 383\u2013392 (2010)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"(10","key":"6_CR25","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"P.K. Ahuja","year":"2000","unstructured":"Ahuja P.K., Orlin J.B., Tiwari A.: A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27((10), 917\u2013934 (2000)","journal-title":"Comput. Oper. Res."},{"key":"6_CR26","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","volume":"39","author":"Q. Zhang","year":"2012","unstructured":"Zhang Q., Manier H., Manier M.A.: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraint and bounded processing times. Comput. Oper. Res. 39, 1713\u20131723 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"6_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.asoc.2006.10.012","volume":"8","author":"Z.J. Lee","year":"2008","unstructured":"Lee Z.J., Su S.F., Chiang C.C., Liu K.H.: Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl. Soft Comput. 8(1), 55\u201378 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"6_CR28","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1080\/00207540802660544","volume":"48","author":"F.M. Defersha","year":"2010","unstructured":"Defersha F.M., Chen M.Y.: A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots. Int. J. Prod. Res. 48(6), 1705\u20131726 (2010)","journal-title":"Int. J. Prod. Res."},{"key":"6_CR29","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S., Gelatto C.D., Vecchi M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"issue":"1\u20132","key":"6_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1504\/IJMTM.2009.023781","volume":"17","author":"F.M. Defersha","year":"2009","unstructured":"Defersha F.M., Chen M.: A simulated annealing algorithm for dynamic system reconfiguration and production planning in cellular manufacturing. Int. J. Manuf. Tech. Manage. 17(1\u20132), 103\u2013124 (2009)","journal-title":"Int. J. Manuf. Tech. Manage."},{"issue":"47","key":"6_CR31","first-page":"265","volume":"44","author":"Y. Sun","year":"2011","unstructured":"Sun Y., Zhang M., Liu W., Li H., Zhang L.: Permutation algorithm with simulated annealing for laser antimissile problem. Appl. Mech. Mater. 44(47), 265\u2013269 (2011)","journal-title":"Appl. Mech. Mater."},{"key":"6_CR32","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s00170-009-2151-3","volume":"46","author":"E. Safari","year":"2010","unstructured":"Safari E., Sadjadi S.J., Shahanaghi K.: Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan. Int. J. Adv. Manuf. Technol. 46, 757\u2013767 (2010)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"6_CR33","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/03052150903127615","volume":"42","author":"S.M. Hashemi","year":"2010","unstructured":"Hashemi S.M., Rezapour M., Moradi A.: An effective hybrid PSO-based algorithm for planning UMTS terrestrial access networks. Eng. Optim. 42(3), 251\u2013311 (2010)","journal-title":"Eng. Optim."},{"issue":"5","key":"6_CR34","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover F., McMillan C.: The general employee scheduling problem: an integration of MS and AI. Comput. Oper. Res. 13(5), 563\u2013573 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"6_CR35","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover F.: Tabu search\u2014part 1. Inf. J. Comput. 1(2), 190\u2013206 (1989)","journal-title":"Inf. J. Comput."},{"issue":"1","key":"6_CR36","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover F.: Tabu search\u2014part 2. Inf. J. Comput. 2(1), 4\u201332 (1990)","journal-title":"Inf. J. Comput."},{"key":"6_CR37","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"T. James","year":"2007","unstructured":"James T., Rego C., Glover F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195, 810\u2013826 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR38","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s00170-008-1404-x","volume":"40","author":"V.P. Eswaramurthy","year":"2009","unstructured":"Eswaramurthy V.P., Tamilarasi A.: Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int. J. Adv. Manuf. Technol. 40, 9\u201310 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of IEEE International Conference on Computational Cybernetics and Simulation, pp. 4104\u20134109. Orlando, USA (1997)","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Al-Kazemi, B., Mohan, C.K.: Discrete multi-phase particle swarm optimization. In: Grana, M., Duro, R., d\u2019Anjou, A., Wang, P.P. (eds.) Information Processing with Evolutionary Algorithms. Advanced Information and Knowledge Processing, pp. 305\u2013327. Springer, Heidelberg (2005)","DOI":"10.1007\/1-84628-117-2_20"},{"key":"6_CR41","unstructured":"Clerc, M.: http:\/\/clerc.maurice.free.fr\/pso\/"},{"issue":"1","key":"6_CR42","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D. Anghinolfi","year":"2009","unstructured":"Anghinolfi D., Paolucci M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 193(1), 73\u201385 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"6_CR43","doi-asserted-by":"crossref","first-page":"3099","DOI":"10.1016\/j.cor.2005.11.017","volume":"34","author":"C.J. Liao","year":"2007","unstructured":"Liao C.J., Tseng C.T., Luarn P.: A discrete version of particle swarm optimization flow shop scheduling problems. Comput. Oper. Res. 34(10), 3099\u20133111 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3\u20134","key":"6_CR44","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.epsr.2006.02.016","volume":"77","author":"Y.X. Jin","year":"2007","unstructured":"Jin Y.X., Cheng H.Z., Yan J.Y., Zhang L.: New discrete method for particle swarm optimization and its application in transmission network expansion planning. Electr. Power Syst. Res. 77(3\u20134), 227\u2013233 (2007)","journal-title":"Electr. Power Syst. Res."},{"issue":"9","key":"6_CR45","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q.K. Pan","year":"2008","unstructured":"Pan Q.K., Tasgentiren M.F., Liang Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9), 2807\u20132839 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"6_CR46","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2007.08.030","volume":"191","author":"C.T. Tseng","year":"2008","unstructured":"Tseng C.T., Liao C.J.: A discrete particle swarm optimization for lot-streaming flow shop scheduling problem. Eur. J. Oper. Res. 191(2), 360\u2013373 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"6_CR47","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","volume":"35","author":"Z. Lian","year":"2008","unstructured":"Lian Z., Gu X., Jiao B.: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solitons Fractals 35(5), 851\u2013861 (2008)","journal-title":"Chaos Solitons Fractals"},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Gherboudj, A., Chikhi, S.: BPSO algorithms for knapsack problem (2011). doi: 10.1007\/978-3-642-21937-5_20","DOI":"10.1007\/978-3-642-21937-5_20"},{"key":"6_CR49","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms (in Italian). PhD thesis, Department of Electronics and Information Polytechnic of Milan, Italy (1992)"},{"issue":"1","key":"6_CR50","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo M., Maniezzo V., Colorni A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"2","key":"6_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo M., Caro G.D., Gambardella L.M.: Ant algorithms for discrete optimization. Artif. Life 5(2), 1\u201336 (1999)","journal-title":"Artif. Life"},{"issue":"4","key":"6_CR52","doi-asserted-by":"crossref","first-page":"1965","DOI":"10.1109\/TPWRS.2007.907382","volume":"22","author":"A.Y. Saber","year":"2007","unstructured":"Saber A.Y., Senjyu T.: Memory-bounded ant colony optimization with dynamic programming and a local search for generator planning. IEEE Trans. Power Syst. 22(4), 1965\u20131973 (2007)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"6_CR53","doi-asserted-by":"crossref","first-page":"174","DOI":"10.5370\/JEET.2011.6.2.174","volume":"6","author":"S.H. Jang","year":"2011","unstructured":"Jang S.H., Roh J.H., Kim W., Sherpa T., Kim J.H., Park J.B.: A novel binary ant colony optimization: application to the unit commitment problem of power systems. J. Electr. Eng. Technol. 6(2), 174\u2013181 (2011)","journal-title":"J. Electr. Eng. Technol."},{"issue":"4","key":"6_CR54","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.apm.2009.07.016","volume":"34","author":"M. Agarwal","year":"2010","unstructured":"Agarwal M., Sharma V.K.: Ant colony approach to constrained redundancy optimization in binary systems. Appl. Math. Model. 34(4), 992\u20131003 (2010)","journal-title":"Appl. Math. Model."},{"key":"6_CR55","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"3","key":"6_CR56","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10898-010-9566-0","volume":"49","author":"A.A. Gaivoronski","year":"2011","unstructured":"Gaivoronski A.A., Lisser A., Lopez R., Hu X.: Knapsack problem with probability constraints. J. Glob. Optim. 49(3), 397\u2013413 (2011)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"6_CR57","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10898-010-9541-9","volume":"49","author":"N. Argyris","year":"2011","unstructured":"Argyris N., Figueira J.R., Morton A.: Identifying preferred solutions to multi-objective binary optimization problems, with an application to the multi-objective knapsack problem. J. Glob. Optim. 49(2), 213\u2013235 (2011)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"6_CR58","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s10898-010-9552-6","volume":"49","author":"G. Mavrotas","year":"2011","unstructured":"Mavrotas G., Figueira J.R., Antoniadis A.: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems. J. Glob. Optim. 49(4), 589\u2013606 (2011)","journal-title":"J. Glob. Optim."},{"key":"6_CR59","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M. Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e M., Teghem J., Ulungu E.L.: Two-phase method and branch and bound procedures to solve the bi-objective knapsack problem. J. Glob. Optim. 12, 139\u2013155 (1998)","journal-title":"J. Glob. Optim."},{"key":"6_CR60","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder H., Johnson E.L., Padberg H.W.: Solving large scale zero\u2013one linear programming problems. Oper. Res. Soc. 31, 803\u2013834 (1983)","journal-title":"Oper. Res. Soc."},{"key":"6_CR61","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser G.L., Savelsbergh M.W.P, Sigismondi G.C.: MINTO, a mixed INTeger optimizer. Oper. Res. Lett. 15, 47\u201358 (1994)","journal-title":"Oper. Res. Lett."},{"key":"6_CR62","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/mnsc.15.4.B196","volume":"15","author":"S. Senju","year":"1968","unstructured":"Senju S., Toyoda Y.: An approach to linear programming with 0\u20131 variables. Manage. Sci. 15, 196\u2013207 (1968)","journal-title":"Manage. Sci."},{"issue":"1","key":"6_CR63","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2006.02.058","volume":"186","author":"S. Balev","year":"2008","unstructured":"Balev S., Yanev N., Fr\u00e9ville A., Andonov R.: A dynamic programming based reduction procedure for the multidimensional 0\u20131 knapsack problem. Eur. J. Oper. Res. 186(1), 63\u201376 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR64","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W. Shih","year":"1979","unstructured":"Shih W.: A branch and bound method for the multiconstraint zero\u2013one knapsack problem. J. Oper. Res. Soc. 30, 369\u2013378 (1979)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR65","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1057\/palgrave.jors.2601401","volume":"53","author":"R. Mansini","year":"2002","unstructured":"Mansini R., Speranza M.G.: A multidimensional knapsack model for the asset-backed securitization. J. Oper. Res. Soc. 53, 822\u2013832 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR66","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"Gilmore P.C., Gomory R.E.: The theory and computation of knapsack functions. Oper. Res. 14, 1045\u20131075 (1966)","journal-title":"Oper. Res."},{"key":"6_CR67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/18.21214","volume":"34","author":"B. Chor","year":"1988","unstructured":"Chor B., Rivest R.L.: A knapsack-type public key cryptosystem based on arithmetic infinite fields. IEEE Trans. Inf. Theory. 34, 1\u201322 (1988)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"6_CR68","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A. Drexl","year":"1988","unstructured":"Drexl A.: A simulated annealing approach to the multiconstraint zero\u2013one knapsack problem. Computing 40, 1\u20138 (1988)","journal-title":"Computing"},{"key":"6_CR69","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-7091-6492-1_55","volume":"3","author":"C. Cotta","year":"1998","unstructured":"Cotta C., Troya J.M.: A hybrid genetic algorithm for the 0\u20131 multiple knapsack problem. Artif. Neural Nets. Genet. Alg. 3, 250\u2013254 (1998)","journal-title":"Artif. Neural Nets. Genet. Alg."},{"key":"6_CR70","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1007\/11881070_94","volume-title":"Advances in Natural Computation","author":"H. Li","year":"2006","unstructured":"Li H., Jiao Y.C., Zhang L., Gu Z.-W.: Genetic algorithm based on the orthogonal design for multidimensional knapsack problems. In: Jiao, L., Wang, L., Gao, X.B., Liu, J., Wu , F. (eds.) Advances in Natural Computation, pp. 696\u2013705. Springer, Heidelberg (2006)"},{"key":"6_CR71","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-540-31852-1_33","volume-title":"Numerical Analysis and its Applications","author":"S. Fidanova","year":"2005","unstructured":"Fidanova S.: Ant colony optimization for multiple knapsack problem and model bias. In: Margenov, S., Vulkov, L.G., Wasniewski, J. (eds.) Numerical Analysis and its Applications, pp. 280\u2013287. Springer, Heidelberg (2005)"},{"key":"6_CR72","first-page":"1140","volume-title":"Artificial Intelligence and Computational Intelligence","author":"M. Kong","year":"2006","unstructured":"Kong M., Tian P.: Apply the particle swarm optimization to the multidimensional knapsack problem. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Zurada , J.M. (eds.) Artificial Intelligence and Computational Intelligence, pp. 1140\u20131149. Springer, Heidelberg (2006)"},{"issue":"11","key":"6_CR73","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","volume":"37","author":"E. Angelelli","year":"2010","unstructured":"Angelelli E., Mansini R., Speranza M.G.: Kernel search: a general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37(11), 2017\u20132026 (2010)","journal-title":"Comput. Oper. Res."},{"key":"6_CR74","volume-title":"Fundamentals of Physics","author":"D. Holliday","year":"1993","unstructured":"Holliday D., Resnick R., Walker J.: Fundamentals of Physics. Wiley, New York (1993)"},{"key":"6_CR75","unstructured":"OR-Library, Beasley, J.E.: http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/mknapinfo.html"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-0006-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0006-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T16:22:55Z","timestamp":1745425375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-0006-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,14]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-0006-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,14]]}}}