{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:25:58Z","timestamp":1773933958779,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T00:00:00Z","timestamp":1762819200000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10586-025-05801-3","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T20:26:42Z","timestamp":1762892802000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["0\/1 Knapsack problem on hyper hexa-cell interconnection network"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3979-1076","authenticated-orcid":false,"given":"Basel A.","family":"Mahafzah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marwan","family":"Al-Tawil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marwan","family":"Krunz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,11]]},"reference":[{"key":"5801_CR1","unstructured":"Pisinger, D.: Algorithms for knapsack problems. Ph.D. Thesis, DIKU, Univ. Copenhagen, Report 95\/1 (1995)"},{"issue":"4","key":"5801_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.4236\/jamp.2013.14006","volume":"1","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Lv, J., Zheng, L.: An algorithm of 0\u20131 knapsack problem based on economic model. J. Appl. Math. Phys. 1(4), 31\u201335 (2013)","journal-title":"J. Appl. Math. Phys."},{"issue":"1","key":"5801_CR3","first-page":"9","volume":"2","author":"AD Rahajoe","year":"2013","unstructured":"Rahajoe, A.D., Winarko, E.: Optimal solution of minmax 0\/1 knapsack problem using dynamic programming. Int. J. Inf. Commun. Technol. 2(1), 9\u201316 (2013)","journal-title":"Int. J. Inf. Commun. Technol."},{"issue":"7","key":"5801_CR4","doi-asserted-by":"publisher","DOI":"10.3390\/math13071097","volume":"13","author":"T Szkaliczki","year":"2025","unstructured":"Szkaliczki, T.: Solution methods for the multiple-choice knapsack problem and their applications. Mathematics 13(7), 1097 (2025)","journal-title":"Mathematics"},{"issue":"4","key":"5801_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/app15042059","volume":"15","author":"J Garcia","year":"2025","unstructured":"Garcia, J., Cattarinich, I., Moraga, P., Pinto, H.: Exploring the impact of local operator configurations in the multi-demand multidimensional knapsack problem. Appl. Sci. 15(4), 1\u201326 (2025). https:\/\/doi.org\/10.3390\/app15042059","journal-title":"Applied Sciences"},{"key":"5801_CR6","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2015.11.045","volume":"41","author":"J Lv","year":"2016","unstructured":"Lv, J., Wang, X., Huang, M., Cheng, H., Li, F.: Solving 0\u20131 knapsack problem by greedy degree and expectation efficiency. Applied Soft Computing 41, 94\u2013103 (2016)","journal-title":"Applied Soft Computing"},{"issue":"2","key":"5801_CR7","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2020.07.023","volume":"289","author":"S Coniglio","year":"2021","unstructured":"Coniglio, S., Furini, F., San Segundo, P.: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. European Journal of Operational Research 289(2), 435\u2013455 (2021)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5801_CR8","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Management Science 45(3), 414\u2013424 (1999)","journal-title":"Management Science"},{"key":"5801_CR9","unstructured":"Andonov, R., Raimbault, F., Quinton, P.: Dynamic Programming Parallel Implementations for the Knapsack Problem. INRIA [Research Report] RR-2037 (1993)"},{"key":"5801_CR10","doi-asserted-by":"publisher","first-page":"6239","DOI":"10.1007\/s11227-019-02847-0","volume":"75","author":"S El Motaki","year":"2019","unstructured":"El Motaki, S., Yahyaouy, A., Gualous, H., Sabor, J.: Comparative study between exact and metaheuristic approaches for virtual machine placement process as knapsack problem. J. Supercomput. 75, 6239\u20136259 (2019)","journal-title":"J. Supercomput."},{"issue":"7","key":"5801_CR11","doi-asserted-by":"publisher","first-page":"8605","DOI":"10.1007\/s11063-023-11171-x","volume":"55","author":"G Yildizdan","year":"2023","unstructured":"Yildizdan, G., Ba\u015f, E.: A novel binary artificial jellyfish search algorithm for solving 0\u20131 knapsack problems. Neural Process. Lett. 55(7), 8605\u20138671 (2023)","journal-title":"Neural Process. Lett."},{"issue":"5","key":"5801_CR12","doi-asserted-by":"publisher","first-page":"5751","DOI":"10.1007\/s10489-021-02717-4","volume":"52","author":"Z Shu","year":"2022","unstructured":"Shu, Z., Ye, Z., Zong, X., Liu, S., Zhang, D., Wang, C., Wang, M.: A modified hybrid rice optimization algorithm for solving 0\u20131 knapsack problem. Appl. Intell. 52(5), 5751\u20135769 (2022)","journal-title":"Appl. Intell."},{"issue":"11","key":"5801_CR13","doi-asserted-by":"publisher","first-page":"13653","DOI":"10.1007\/s11227-022-04425-3","volume":"78","author":"E-M Huang","year":"2022","unstructured":"Huang, E.-M., Chou, J.: Optimization of multi-class 0\/1 knapsack problem on GPUs by improving memory access efficiency. J. Supercomput. 78(11), 13653\u201313679 (2022)","journal-title":"J. Supercomput."},{"issue":"6","key":"5801_CR14","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/BF02973436","volume":"19","author":"K-L Li","year":"2004","unstructured":"Li, K.-L., Li, R.-F., Li, Q.-H.: Optimal parallel algorithms for the knapsack problem without memory conflicts. Journal of Computer Science and Technology 19(6), 760\u2013768 (2004)","journal-title":"Journal of Computer Science and Technology"},{"key":"5801_CR15","doi-asserted-by":"publisher","first-page":"21177","DOI":"10.1007\/s00521-024-10327-7","volume":"36","author":"M Lu","year":"2024","unstructured":"Lu, M., Lu, H., Hou, X., Hu, Q.: A self-adaptive arithmetic optimization algorithm with hybrid search modes for 0\u20131 knapsack problem. Neural Computing and Applications 36, 21177\u201321210 (2024). https:\/\/doi.org\/10.1007\/s00521-024-10327-7","journal-title":"Neural Computing and Applications"},{"key":"5801_CR16","doi-asserted-by":"publisher","first-page":"810","DOI":"10.3103\/S014641161807026X","volume":"52","author":"V Vasilchikov","year":"2018","unstructured":"Vasilchikov, V.: On \u0430 recursive-parallel algorithm for solving the knapsack problem. Automatic Control and Computer Sciences 52, 810\u2013816 (2018)","journal-title":"Automatic Control and Computer Sciences"},{"issue":"1","key":"5801_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10(1), 196\u2013210 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"5801_CR18","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00607-011-0177-5","volume":"94","author":"B Mahafzah","year":"2012","unstructured":"Mahafzah, B., Sleit, A., Hamad, N.A., Ahmad, E.F., Abu-Kabeer, T.M.: The OTIS hyper hexa-cell optoelectronic architecture. Computing 94, 411\u2013432 (2012)","journal-title":"Computing"},{"key":"5801_CR19","first-page":"115","volume":"13","author":"B Mahafzah","year":"2019","unstructured":"Mahafzah, B., Alshraideh, M., Tahat, L., Almasri, N.: Topological properties assessment for hyper hexa-cell interconnection network. Int. J. Comput 13, 115\u2013121 (2019)","journal-title":"Int. J. Comput"},{"key":"5801_CR20","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.procs.2016.07.444","volume":"88","author":"MA Kupriyashin","year":"2016","unstructured":"Kupriyashin, M.A., Borzunov, G.I.: Computational load balancing algorithm for parallel knapsack packing tree traversal. Procedia Computer Science 88, 330\u2013335 (2016)","journal-title":"Procedia Computer Science"},{"issue":"4","key":"5801_CR21","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0743-7315(88)90007-X","volume":"5","author":"J Lee","year":"1988","unstructured":"Lee, J., Shragowitz, E., Sahni, S.: A hypercube algorithm for the 0\/1 knapsack problem. Journal of Parallel and Distributed Computing 5(4), 438\u2013456 (1988)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5801_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s11235-017-0322-3","volume":"67","author":"B Mahafzah","year":"2018","unstructured":"Mahafzah, B., Al-Zoubi, I.: Broadcast communication operations for hyper hexa-cell interconnection network. Telecommun Syst. 67, 73\u201393 (2018)","journal-title":"Telecommun Syst."},{"key":"5801_CR23","doi-asserted-by":"crossref","unstructured":"Al-Adwan, A., Mahafzah, B., Aladwan, A.: Load balancing problem on hyper hexa cell interconnection network. Int. J. Adv. Comput. Sci. Appl. 11(10), 373\u2013379 (2020)","DOI":"10.14569\/IJACSA.2020.0111046"},{"issue":"3","key":"5801_CR24","first-page":"334","volume":"8","author":"M Abdullah","year":"2011","unstructured":"Abdullah, M., Abuelrub, E., Mahafzah, B.: The chained-cubic tree interconnection network. Int. Arab. J. Inform. Technol. 8(3), 334\u2013343 (2011)","journal-title":"Int. Arab. J. Inform. Technol."},{"key":"5801_CR25","doi-asserted-by":"publisher","first-page":"8729","DOI":"10.1007\/s11227-022-05005-1","volume":"79","author":"C-H Liang","year":"2023","unstructured":"Liang, C.-H., Cheng, C.-H., Wu, H.-L., Li, C.-C., Huang, P.-L., Hwang, C.-C.: Performance evaluation of multi-exaflops machines using equality network topology. J. Supercomput. 79, 8729\u20138753 (2023). https:\/\/doi.org\/10.1007\/s11227-022-05005-1","journal-title":"J. Supercomput."},{"key":"5801_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-8160-7_12","volume-title":"Intelligent Systems. ICMIB 2024. Lecture Notes in Networks and Systems","author":"R Padhi","year":"2025","unstructured":"Padhi, R., Adhikari, N.: Leafy Tor-Cube: A new scalable hybrid interconnection network for high performance computers. In: Kumar, U.S., Sethi, S., Ghinea, G., Kuanar, S.K. (eds.) Intelligent Systems. ICMIB 2024. Lecture Notes in Networks and Systems, vol. 1149. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-97-8160-7_12"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05801-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05801-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05801-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T13:08:39Z","timestamp":1773925719000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05801-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["5801"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05801-3","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,11]]},"assertion":[{"value":"31 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors have read and approved the final version of the manuscript and agree to its submission to the journal. Also, all authors give consent to publish this article upon acceptance.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}}],"article-number":"2"}}