{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:43:54Z","timestamp":1725648234501},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245527"},{"type":"electronic","value":"9783642245534"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-24553-4_27","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T09:49:00Z","timestamp":1325584140000},"page":"191-198","source":"Crossref","is-referenced-by-count":1,"title":["A New Hybrid Algorithm for the Multidimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Xiaoxia","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Zhe","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qiuying","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"Gilmore, P.C., Gomory, R.E.: The theory and computation of knapsack functions. Operations Research\u00a014, 1045\u20131075 (1966)","journal-title":"Operations Research"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Beaujon, G.J., Martin, S.P., McDonald, C.C.: Balancing and optimizing a portfolio of R&D projects. Naval Research Logistics 4818\u20134840 (2001)","DOI":"10.1002\/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7"},{"key":"27_CR3","first-page":"215","volume-title":"Management of Distributed Data Processing","author":"B. Gavish","year":"1982","unstructured":"Gavish, B., Pirkul, H.: Allocation of databases and processors in a distributed data processing. In: Akola, J. (ed.) Management of Distributed Data Processing, pp. 215\u2013231. North-Holland, Amsterdam (1982)"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A. Drexl","year":"1988","unstructured":"Drexl, A.: A simulated annealing approach to the multiconstraint zero\u2013one knapsack problem. Computing\u00a040, 1\u20138 (1988)","journal-title":"Computing"},{"key":"27_CR5","unstructured":"Dammeyer, F., Voss, S.: Application of tabu search strategies for solving multiconstraint zero\u2013one knapsack problems. In: Working Paper, Technische Hochschule Darmstadt, Germany (1991)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing\u00a06, 126\u2013140 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"27_CR7","first-page":"226","volume":"32","author":"J. Thiel","year":"1994","unstructured":"Thiel, J., Voss, S.: Some experiences on solving multiconstraint zero\u2013one knapsack problems with genetic algorithms. INFOR\u00a032, 226\u2013242 (1994)","journal-title":"INFOR"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P. Chu","year":"1998","unstructured":"Chu, P., Beasley, J.: A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristics\u00a04, 63\u201386 (1998)","journal-title":"Journal of Heuristics"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems\u00a043, 73\u201381 (1997)","journal-title":"BioSystems"},{"key":"27_CR10","unstructured":"Leguizamon, G., Michalewicz, Z.: A new version of ant system for subset problem. In: Congress on Evolutionary Computation, pp. 1456\u20131464 (1999)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences, 8156\u20138166 (1977)","DOI":"10.1111\/j.1540-5915.1977.tb01074.x"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"J.E. Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics\u00a018, 41\u201348 (2004)","journal-title":"Advanced Engineering Informatics"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Russell, R.A., Chiang, W.C.: Scatter search for the vehicle routing problem with time windows. European Journal of Operational Research 169, 606\u2013622 (2006)","DOI":"10.1016\/j.ejor.2004.08.018"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","volume":"169","author":"M. Marti","year":"2006","unstructured":"Marti, M., Laguna, M., Glover, F.: Principles of scatter search. European Journal of Operational Research\u00a0169, 359\u2013372 (2006)","journal-title":"European Journal of Operational Research"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0377-2217(84)90286-8","volume":"16","author":"M.J. Magazine","year":"1984","unstructured":"Magazine, M.J., Oguz, O.: A heuristic algorithm for the multidimensional zero-one Knapsack Problem. European Journal of Operational Research\u00a016, 319\u2013326 (1984)","journal-title":"European Journal of Operational Research"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1057\/jors.1990.148","volume":"41","author":"A. Volgenant","year":"1990","unstructured":"Volgenant, A., Zoon, J.A.: An improved heuristic for multidimensional 0-1 knapsack problems. Journal of the Operational Research Society\u00a041, 963\u2013970 (1990)","journal-title":"Journal of the Operational Research Society"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H. Pirkul","year":"1987","unstructured":"Pirkul, H.: A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics\u00a034, 161\u2013172 (1987)","journal-title":"Naval Research Logistics"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24553-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T19:46:03Z","timestamp":1686599163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24553-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642245527","9783642245534"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24553-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}