{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T05:40:12Z","timestamp":1744782012215,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"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":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00372-2","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T11:02:16Z","timestamp":1729162936000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Branch-and-Bound and Dynamic Programming Approaches for the Knapsack Problem"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0838-0250","authenticated-orcid":false,"given":"Evgenii","family":"Burashnikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"issue":"5","key":"372_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R Merkle","year":"1978","unstructured":"Merkle R, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"372_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1090\/S0002-9904-1954-09848-8","volume":"60","author":"R Bellman","year":"1954","unstructured":"Bellman R (1954) The theory of dynamic programming. Bull Am Math Soc 60(6):503\u2013515","journal-title":"Bull Am Math Soc"},{"issue":"9","key":"372_CR3","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"GL Nemhauser","year":"1969","unstructured":"Nemhauser GL, Ullmann Z (1969) Discrete dynamic programming and capital allocation. Manage Sci 15(9):494\u2013505","journal-title":"Manage Sci"},{"issue":"10","key":"372_CR4","doi-asserted-by":"publisher","first-page":"12415","DOI":"10.1016\/j.eswa.2011.04.022","volume":"38","author":"E Bas","year":"2011","unstructured":"Bas E (2011) A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0\u20131 bidimensional knapsack model. Expert Syst Appl 38(10):12415\u201312422","journal-title":"Expert Syst Appl"},{"key":"372_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Multidimensional knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Multidimensional knapsack problems. Springer, Berlin, Heidelberg"},{"key":"372_CR6","doi-asserted-by":"crossref","unstructured":"Taillandier F, Fernandez C, Ndiaye A (2017) Real estate property maintenance optimization based on multiobjective multidimensional knapsack problem. Comput\u2010Aided Civ Infrastruct Eng 32(3):227\u2013251","DOI":"10.1111\/mice.12246"},{"issue":"2","key":"372_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D Pisinger","year":"2002","unstructured":"Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141(2):382\u2013392","journal-title":"Eur J Oper Res"},{"issue":"1","key":"372_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.cor.2010.10.021","volume":"39","author":"PT Chang","year":"2012","unstructured":"Chang PT, Lee JH (2012) A fuzzy DEA and knapsack formulation integrated model for project selection. Comput Oper Res 39(1):112\u2013125","journal-title":"Comput Oper Res"},{"key":"372_CR9","doi-asserted-by":"publisher","unstructured":"Pfeiffer J, Rothlauf F (2007) Analysis of greedy heuristics and weight-coded eas for multidimensional knapsack problems and multi-unit combinatorial auctions. In Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp 1529\u20131529.https:\/\/doi.org\/10.1145\/1276958.1277258","DOI":"10.1145\/1276958.1277258"},{"issue":"9","key":"372_CR10","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"PJ Kolesar","year":"1967","unstructured":"Kolesar PJ (1967) A branch and bound algorithm for the knapsack problem. Manag Sci 13(9):723\u2013735","journal-title":"Manag Sci"},{"key":"372_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S Martello","year":"1977","unstructured":"Martello S, Toth P (1977) An upper bound for the zero-one knapsack. Eur J Oper Res 1:169\u2013175","journal-title":"Eur J Oper Res"},{"issue":"1","key":"372_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"RM Nauss","year":"1976","unstructured":"Nauss RM (1976) An efficient algorithm for the 0\u20131 knapsack problem. Manag Sci 23(1):27\u201331","journal-title":"Manag Sci"},{"key":"372_CR13","doi-asserted-by":"publisher","unstructured":"Lalami ME, El-Baz D (2012) GPU implementation of the branch and bound method for knapsack problems. In 2012 IEEE 26th international parallel and distributed processing symposium workshops & PhD Forum, pp 1769\u20131777. https:\/\/doi.org\/10.1109\/IPDPSW.2012.219","DOI":"10.1109\/IPDPSW.2012.219"},{"key":"372_CR14","doi-asserted-by":"publisher","unstructured":"Ghassemi-Tari F, Hendizadeh H, Hogg GL (2018) Exact solution algorithms for multi-dimensional multiple-choice knapsack problems. Curr J Appl Sci Technol 1\u201321. https:\/\/doi.org\/10.9734\/CJAST\/2018\/40420","DOI":"10.9734\/CJAST\/2018\/40420"},{"issue":"3","key":"372_CR15","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 (1999) Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag Sci 45(3):414\u2013424","journal-title":"Manag Sci"},{"key":"372_CR16","unstructured":"Pushpa SK, Mrunal TV, Suhas C (2016) A study of performance analysis on Knapsack problem. Int J Comput Appl"},{"key":"372_CR17","unstructured":"Manaseer S, Almogdady H (2017) New hybrid approach to solve the 0\/1, bounded knapsack problem. Int J Fut Revol Comput Sci Commun Eng 3:2454"},{"key":"372_CR18","doi-asserted-by":"publisher","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\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"issue":"1","key":"372_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s12293-017-0232-7","volume":"10","author":"A Rezoug","year":"2018","unstructured":"Rezoug A, Bader-El-Den M, Boughaci D (2018) Guided genetic algorithm for the multidimensional knapsack problem. Memetic Comp 10(1):29\u201342","journal-title":"Memetic Comp"},{"issue":"2","key":"372_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Toth P (2000) New trends in exact algorithms for the 0\u20131 knapsack problem. Eur J Oper Res 123(2):325\u2013332","journal-title":"Eur J Oper Res"},{"issue":"1","key":"372_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"GT Ross","year":"1975","unstructured":"Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math Program 8(1):91\u2013103","journal-title":"Math Program"},{"key":"372_CR22","unstructured":"Hristakeva M, Shrestha D (2005, April) Different approaches to solve the 0\/1 knapsack problem. In:\u00a0The Midwest Instruction and Computing Symposium"},{"issue":"2","key":"372_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5(2):266\u2013288","journal-title":"Oper Res"},{"key":"372_CR24","unstructured":"Pisinger D (2018) Instances of 0\/1 knapsack problem. [Online]. Retrieved from September 30, 2024, from http:\/\/artemisa.unicauca.edu.co\/~johnyortega\/instances"},{"key":"372_CR25","doi-asserted-by":"crossref","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Multidimensional knapsack problems. Springer Berlin Heidelberg, pp 235\u2013283","DOI":"10.1007\/978-3-540-24777-7_9"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00372-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00372-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00372-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T16:03:31Z","timestamp":1734710611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00372-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"references-count":25,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["372"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00372-2","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"27 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","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":"Competing Interests"}}],"article-number":"98"}}