{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:55:54Z","timestamp":1783749354640,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,5]],"date-time":"2009-11-05T00:00:00Z","timestamp":1257379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-009-0660-y","type":"journal-article","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T19:33:36Z","timestamp":1257363216000},"page":"97-119","source":"Crossref","is-referenced-by-count":35,"title":["A branch-and-bound algorithm for hard multiple knapsack problems"],"prefix":"10.1007","volume":"184","author":[{"given":"Alex S.","family":"Fukunaga","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,11,5]]},"reference":[{"key":"660_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(00)00010-7","volume":"73","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., & Pferchy, U. (2000). A PTAS for the multiple-subset sum problem with different knapsack capacities. Information Processing Letters, 73, 111\u2013118.","journal-title":"Information Processing Letters"},{"key":"660_CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1022584312032","volume":"9","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Kellerer, H., & Pferschy, U. (2003). A 3\/4-approximation algorithm for multiple subset sum. Journal of Heuristics, 9, 99\u2013111.","journal-title":"Journal of Heuristics"},{"key":"660_CR3","unstructured":"Chekuri, C., & Khanna, S. (2000). A ptas for the multiple knapsack problem. In Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms (pp. 213\u2013222)."},{"issue":"5","key":"660_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","volume":"17","author":"S. Eilon","year":"1971","unstructured":"Eilon, S., & Christofides, N. (1971). The loading problem. Management Science, 17(5), 259\u2013268.","journal-title":"Management Science"},{"key":"660_CR5","doi-asserted-by":"crossref","unstructured":"Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In Proceedings of the international conference on constraint programming (pp. 93\u2013107).","DOI":"10.1007\/3-540-45578-7_7"},{"key":"660_CR6","unstructured":"Fischetti, M., & Salvagnin, D. (2008). Pruning moves (Technical report)."},{"issue":"4","key":"660_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0167-6377(88)90025-9","volume":"7","author":"M. Fischetti","year":"1988","unstructured":"Fischetti, M., & Toth, P. (1988). A new dominance procedure for combinatorial optimization problems. Operations Research Letters, 7(4), 181\u2013186.","journal-title":"Operations Research Letters"},{"key":"660_CR8","doi-asserted-by":"crossref","unstructured":"Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In Proceedings of the international conference on constraint programming (pp. 77\u201392).","DOI":"10.1007\/3-540-45578-7_6"},{"key":"660_CR9","unstructured":"Focacci, F., & Shaw, P. (2002). Pruning sub-optimal search branches using local search. In Proceedings of the fourth international workshop on integration of AI and OR techniques in constrain programming for combinatorial optimisation problems (CP-AI-OR) (pp. 181\u2013189)."},{"key":"660_CR10","doi-asserted-by":"crossref","unstructured":"Fukunaga, A. (2008). A new grouping genetic algorithm for the multiple knapsack problem. In Proceedings of the IEEE congress on evolutionary computation (pp. 2225\u20132232).","DOI":"10.1109\/CEC.2008.4631094"},{"key":"660_CR11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1613\/jair.2106","volume":"28","author":"A. Fukunaga","year":"2007","unstructured":"Fukunaga, A., & Korf, R. (2007). Bin-completion algorithms for multicontainer packing, knapsack, and covering problems. Journal of Artificial Intelligence Research, 28, 393\u2013429.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"660_CR12","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1002\/nav.3800250316","volume":"24","author":"M. Hung","year":"1978","unstructured":"Hung, M., & Fisk, J. (1978). An algorithm for the 0-1 multiple knapsack problem. Naval Research Logistics Quarterly, 24, 571\u2013579.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"6","key":"660_CR13","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1287\/opre.23.6.1110","volume":"23","author":"G. Ingargiola","year":"1975","unstructured":"Ingargiola, G., & Korsh, J. (1975). An algorithm for the solution of 0-1 loading problems. Operations Research, 23(6), 1110\u20131119.","journal-title":"Operations Research"},{"key":"660_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1011589804040","volume":"1","author":"J. Kalagnanam","year":"2001","unstructured":"Kalagnanam, J., Davenport, A., & Lee, H. (2001). Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research, 1, 221\u2013238.","journal-title":"Electronic Commerce Research"},{"key":"660_CR15","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/S0377-2217(02)00466-6","volume":"149","author":"M. Labb\u00e9","year":"2003","unstructured":"Labb\u00e9, M., Laporte, G., & Martello, S. (2003). Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research, 149, 490\u2013498.","journal-title":"European Journal of Operational Research"},{"key":"660_CR16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(81)90005-6","volume":"3","author":"S. Martello","year":"1981","unstructured":"Martello, S., & Toth, P. (1981a). A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics, 3, 275\u2013288.","journal-title":"Discrete Applied Mathematics"},{"key":"660_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02243544","volume":"27","author":"S. Martello","year":"1981","unstructured":"Martello, S., & Toth, P. (1981b). Heuristic algorithms for the multiple knapsack problem. Computing, 27, 93\u2013112.","journal-title":"Computing"},{"key":"660_CR18","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: algorithms and computer implementations. New York: Wiley."},{"key":"660_CR19","unstructured":"Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proceedings of AAAI (pp. 459\u2013465)."},{"key":"660_CR20","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D. Pisinger","year":"1999","unstructured":"Pisinger, D. (1999). An exact algorithm for large multiple knapsack problems. European Journal of Operational Research, 114, 528\u2013541.","journal-title":"European Journal of Operational Research"},{"key":"660_CR21","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D. Pisinger","year":"2005","unstructured":"Pisinger, D. (2005). Where are the hard knapsack problems? Computers and Operations Research, 32, 2271\u20132284.","journal-title":"Computers and Operations Research"},{"key":"660_CR22","doi-asserted-by":"crossref","unstructured":"Raidl, G. (1999). The multiple container packing problem: a genetic algorithm approach with weighted codings. In ACM SIGAPP applied computing review (pp. 22\u201331).","DOI":"10.1145\/335527.335530"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0660-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0660-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0660-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:58Z","timestamp":1559153278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0660-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,5]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["660"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0660-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,5]]}}}