{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:15:01Z","timestamp":1725732901109},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386787"},{"type":"electronic","value":"9783642386794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38679-4_55","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T11:11:51Z","timestamp":1371726711000},"page":"547-555","source":"Crossref","is-referenced-by-count":4,"title":["Improved Swap Heuristic for the Multiple Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Yacine","family":"Laalaoui","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02243544","volume":"27","author":"S. Martello","year":"1981","unstructured":"Martello, S., Toth, P.: Heuristic algorithms for the multiple knapsack problem. Computing\u00a027, 93\u2013112 (1981)","journal-title":"Computing"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Fukunaga, A.: A new grouping genetic algorithm for the multiple knapsack problem. In: Proc. IEEE Congress on Evolutionary Computation, pp. 2225\u20132232 (2008)","DOI":"10.1109\/CEC.2008.4631094"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Fukunaga, A., Tazoe, S.: Combining Multiple Representations in a Genetic Algorithm for the Multiple Knapsack Problem. In: Proc of the 11th IEEE Congress on Evolutionary Computation, pp. 2423\u20132430 (2009)","DOI":"10.1109\/CEC.2009.4983244"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Raidl, R.: The multiple container packing problem: A genetic algorithm approach with weighted codings. ACM SIGAPP Applied Computing Review, 22\u201331 (1999)","DOI":"10.1145\/335527.335530"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E. Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics\u00a02, 5\u201330 (1996)","journal-title":"Journal of Heuristics"},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D. Pisinger","year":"1999","unstructured":"Pisinger, D.: An exact algorithm for large multiple knapsack problems. European Journal of Operational Research\u00a0114, 528\u2013541 (1999)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"55_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-009-0660-y","volume":"184","author":"A. Fukunaga","year":"2011","unstructured":"Fukunaga, A.: A branch-and-bound algorithm for hard multiple knapsack problems. Annals of Operations Research\u00a0184(1), 97\u2013119 (2011)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38679-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T05:33:02Z","timestamp":1557811982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38679-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386787","9783642386794"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38679-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}