{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:32:24Z","timestamp":1760661144637,"version":"build-2065373602"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T00:00:00Z","timestamp":1755734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T00:00:00Z","timestamp":1755734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-04893-5","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T06:20:57Z","timestamp":1755757257000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weighted quantum genetic algorithm for one-dimensional bin packing problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Thae-Gyong","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nam-Chol","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myong-Chol","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ju-Song","family":"Ryom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Su-Ryon","family":"Ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,21]]},"reference":[{"key":"4893_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman & Co., New York (1979)"},{"issue":"8","key":"4893_CR2","first-page":"49","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(8), 49\u201359 (1961)","journal-title":"Oper. Res."},{"key":"4893_CR3","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"4893_CR4","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.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"2","key":"4893_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"J De Carvalho","year":"2002","unstructured":"De Carvalho, J.: Lp models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141(2), 253\u2013273 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4893_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","volume":"17","author":"J De Carvalho","year":"2005","unstructured":"De Carvalho, J.: Using extra dual cuts to accelerate column generation. INFORMSJ Comput. 17(2), 175\u2013182 (2005)","journal-title":"INFORMSJ Comput."},{"issue":"2","key":"4893_CR7","first-page":"249","volume":"130","author":"F Vanderbeck","year":"2011","unstructured":"Vanderbeck, F.: Branching in branch-and-price: a generic scheme. MathProgram 130(2), 249\u2013294 (2011)","journal-title":"MathProgram"},{"key":"4893_CR8","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1287\/opre.1120.1109","volume":"60","author":"M Dell Amico","year":"2012","unstructured":"Dell Amico, M., D\u00edaz, J.C.D., Iori, M.: The bin packing problem with precedence constraints. Oper. Res. 60, 1491\u20131504 (2012)","journal-title":"Oper. Res."},{"issue":"11","key":"4893_CR9","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1016\/j.cor.2011.01.001","volume":"38","author":"TG Crainic","year":"2011","unstructured":"Crainic, T.G., Perboli, G., Rei, W., Tadei, R.: Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11), 1474\u20131482 (2011)","journal-title":"Comput. Oper. Res."},{"key":"4893_CR10","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.sbspro.2014.01.101","volume":"111","author":"G Perboli","year":"2014","unstructured":"Perboli, G., Gobbato, L., Perfetti, F.: Packing problems in transportation and supply chain: new problems and trends. Proc. Soc. Behav. Sci. 111, 672\u2013681 (2014)","journal-title":"Proc. Soc. Behav. Sci."},{"issue":"3","key":"4893_CR11","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Haussner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"4893_CR12","first-page":"367","volume-title":"Vehicle routing, handbooks in operations research and management science","author":"J Cordeau","year":"2007","unstructured":"Cordeau, J., Laporte, G., Savelsbergh, M., Vigo, D.: Vehicle routing, handbooks in operations research and management science, vol. 14, pp. 367\u2013428. Elsevier, Amsterdam (2007)"},{"issue":"2","key":"4893_CR13","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.ejor.2006.01.003","volume":"177","author":"N Skorin-Kapov","year":"2007","unstructured":"Skorin-Kapov, N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177(2), 1167\u20131179 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"4893_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/1687814017707131","volume":"9","author":"G Guan","year":"2017","unstructured":"Guan, G., Lin, Y.: Implementation of quantum-behaved genetic algorithm in ship local structural optimal design. Adv. Mech. Eng. 9(6), 1\u20137 (2017)","journal-title":"Adv. Mech. Eng."},{"issue":"2","key":"4893_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.31341\/jios.44.2.9","volume":"44","author":"S Sahni","year":"2020","unstructured":"Sahni, S., Aggarwal, V., Khanna, A., Gupta, D., Bhattacharyya, S.: Quantum-inspired evolutionary algorithms for neural network weight distribution: a classification model for Parkinson\u2019s disease. JIOS 44(2), 345\u2013363 (2020)","journal-title":"JIOS"},{"key":"4893_CR16","doi-asserted-by":"crossref","unstructured":"Ye, W., Liu, R., Li, Y., Jiao, L.: Quantum-inspired evolutionary algorithm for convolutional neural networks architecture search, IEEE, 1\u20138 (2020)","DOI":"10.1109\/CEC48606.2020.9185727"},{"key":"4893_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-023-03858-w","author":"I-H Choe","year":"2023","unstructured":"Choe, I.-H., Kim, G.-J., Kim, N.-C., Ko, M.-C., Ryom, J.-S., et al.: Can quantum genetic algorithm really improve quantum backpropagation neural network? Quantum Inf. Process. (2023). https:\/\/doi.org\/10.1007\/s11128-023-03858-w","journal-title":"Quantum Inf. Process."},{"key":"4893_CR18","doi-asserted-by":"publisher","unstructured":"Shi, S., Zhang, X.-L., Zhao, X.-L., Yang, L., Du, W., Wang, Y.J.: Prediction of RNA secondary structure using a multi-population assisted quantum genetic algorithm. Human Heredity https:\/\/doi.org\/10.1159\/000501480 (2020)","DOI":"10.1159\/000501480"},{"issue":"4","key":"4893_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04893-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-04893-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-04893-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:39:37Z","timestamp":1760636377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-04893-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,21]]},"references-count":19,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["4893"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-04893-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,8,21]]},"assertion":[{"value":"16 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The submitted work is original and has not been published elsewhere in any form or language (partially or in full).","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All authors consent to participate.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors consent to participate.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"279"}}