{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:45:44Z","timestamp":1742975144269,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_41","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"555-559","source":"Crossref","is-referenced-by-count":0,"title":["Recent Hybrid Techniques for the Multi-Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Carlos Diego","family":"Rodrigues","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Michelon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoel B.","family":"Camp\u00ealo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Beasley, J.E.: OR-Library Instances, \n                      http:\/\/people.brunel.ac.uk\/%7Emastjjb\/jeb\/info.html"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 189\u2013203. Springer, Heidelberg (1999)"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0166-218X(94)90209-7","volume":"49","author":"A. Fr\u00e9ville","year":"1994","unstructured":"Fr\u00e9ville, A., Plateau, G.: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. Discret Appl Math.\u00a049, 189\u2013212 (1994)","journal-title":"Discret Appl Math."},{"key":"41_CR4","unstructured":"Hooker, J.N.: Logic, Optimization and Constraint Programming (manuscript, 2001)"},{"issue":"3","key":"41_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10288-006-0019-z","volume":"4","author":"M. Milano","year":"2006","unstructured":"Milano, M., Wallace, M.: Integrating operations research in constraint programming. 4OR\u00a04(3), 175\u2013219 (2006)","journal-title":"4OR"},{"key":"41_CR6","unstructured":"Oliva, C., Michelon, P., Artigues, C.: Constraint and Linear Programming: Using Reduced Costs for solving the Zero\/One Multiple Knapsack Problem. In: International Conference on Constraint Programming, Proceedings of the workshop on Cooperative Solvers in Constraint Programming(CoSolv 2001), Paphos, Cyprus, pp. 87\u201398 (2001)"},{"key":"41_CR7","unstructured":"Osorio, M.A., Glover, F.: Logic cuts using surrogate constraint analysis in the multidimensional knapsack problem. In: CPAIOR 2001 (2001)"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1021513321301","volume":"117","author":"M.A. Osorio","year":"2002","unstructured":"Osorio, M.A., Glover, F., Hammer, P.: Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions. Annals of Operations Research\u00a0117, 71\u201393 (2002)","journal-title":"Annals of Operations Research"},{"key":"41_CR9","unstructured":"Vasquez, M., Hao, J.K.: A Hybrid Approach for the 01 Multidimensional Knapsack problem. IJCAI, 328\u2013333 (2001)"},{"issue":"2","key":"41_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10878-007-9074-4","volume":"15","author":"Y. Vimont","year":"2008","unstructured":"Vimont, Y., Boussier, S., Vasquez, M.: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. Journal of Combinatorial Optimization\u00a015(2), 165\u2013178 (2008)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:07:01Z","timestamp":1715238421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}