{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:09:50Z","timestamp":1725808190177},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44739-0_66","type":"book-chapter","created":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T22:56:21Z","timestamp":1409007381000},"page":"539-546","source":"Crossref","is-referenced-by-count":1,"title":["A Multidimensional Multiple-Choice Knapsack Model for Resource Allocation in a Construction Equipment Manufacturer Setting Using an Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"Alejandra","family":"Duenas","sequence":"first","affiliation":[]},{"given":"Christine","family":"Di Martinelly","sequence":"additional","affiliation":[]},{"given":"G. Yazg\u0131","family":"T\u00fct\u00fcnc\u00fc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"66_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0196-6774(84)90043-9","volume":"5","author":"P. Ramanan","year":"1984","unstructured":"Ramanan, P., Deogun, J.S., Liu, C.L.: A personnel assignment problem. Journal of Algorithms\u00a05(1), 132\u2013144 (1984)","journal-title":"Journal of Algorithms"},{"issue":"9","key":"66_CR2","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M.L. Fisher","year":"1986","unstructured":"Fisher, M.L., Jaikumar, R., Wassenhove, L.N.V.: A Multiplier Adjustment Method for the Generalized Assignment Problem. Management Science\u00a032(9), 1095\u20131103 (1986)","journal-title":"Management Science"},{"issue":"3","key":"66_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"D.G. Cattrysse","year":"1992","unstructured":"Cattrysse, D.G., Van Wassenhove, L.N.: A survey of algorithms for the generalized assignment problem. European Journal of Operational Research\u00a060(3), 260\u2013272 (1992)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"66_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0377-2217(00)00108-9","volume":"132","author":"J.A. D\u0131az","year":"2001","unstructured":"D\u0131az, J.A., Fern\u00e1ndez, E.: A Tabu search heuristic for the generalized assignment problem. European Journal of Operational Research\u00a0132(1), 22\u201338 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"1-3","key":"66_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(99)00224-3","volume":"103","author":"H.E. Romeijn","year":"2000","unstructured":"Romeijn, H.E., Morales, D.R.: A class of greedy algorithms for the generalized assignment problem. Discrete Applied Mathematics\u00a0103(1-3), 209\u2013235 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"66_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"P.C. Chu","year":"1997","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalised assignment problem. Computers & Operations Research\u00a024(1), 17\u201323 (1997)","journal-title":"Computers & Operations Research"},{"issue":"11","key":"66_CR7","doi-asserted-by":"publisher","first-page":"3782","DOI":"10.1016\/j.amc.2009.11.018","volume":"215","author":"L. \u00d6zbakir","year":"2010","unstructured":"\u00d6zbakir, L., Baykaso\u011flu, A., Tapkan, P.: Bees algorithm for generalized assignment problem. Applied Mathematics and Computation\u00a0215(11), 3782\u20133795 (2010)","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"66_CR8","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.ejor.2010.05.007","volume":"207","author":"A.J. Woodcock","year":"2010","unstructured":"Woodcock, A.J., Wilson, J.M.: A hybrid tabu search\/branch & bound approach to solving the generalized assignment problem. European Journal of Operational Research\u00a0207(2), 566\u2013578 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"66_CR9","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"D.W. Pentico","year":"2007","unstructured":"Pentico, D.W.: Assignment problems: A golden anniversary survey. European Journal of Operational Research\u00a0176(2), 774\u2013793 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"66_CR10","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/0377-2217(94)90253-4","volume":"73","author":"S. Geetha","year":"1994","unstructured":"Geetha, S., Vartak, M.N.: The three-dimensional bottleneck assignment problem with capacity constraints. European Journal of Operational Research\u00a073(3), 562\u2013568 (1994)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"66_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1111\/j.1540-5915.1988.tb00269.x","volume":"19","author":"K.C. Gilbert","year":"1988","unstructured":"Gilbert, K.C., Hofstra, R.B.: multidimensional assignment problems. Decision Sciences\u00a019(2), 306\u2013321 (1988)","journal-title":"Decision Sciences"},{"key":"66_CR12","volume-title":"Knapsack problems","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems. Wiley, New York (1990)"},{"issue":"12","key":"66_CR13","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M. Hifi","year":"2004","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple-choice multidimensional knapsack problem. Journal of the Operational Research Society\u00a055(12), 1323\u20131332 (2004)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"66_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10479-013-1387-3","volume":"206","author":"M. Tavana","year":"2013","unstructured":"Tavana, M., Khalili-Damghani, K., Abtahi, A.-R.: A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm. Annals of Operations Research\u00a0206(1), 449\u2013483 (2013)","journal-title":"Annals of Operations Research"},{"key":"66_CR15","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T. (ed.): Introduction to evolutionary algorithms. In: B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.) Evolutionary Computation. ch. 7, vol.\u00a01. Institute of Physics Publishing (2000)","DOI":"10.1201\/9781420034349"},{"key":"66_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BFb0029727","volume-title":"Parallel Problem Solving from Nature","author":"I. Ouranos","year":"1991","unstructured":"Ouranos, I., Stefaneas, P.: Towards an Optimal Mutation Probability for Genetic Algorithms. In: Schwefel, H.-P., M\u00e4nner, R. (eds.) SERA 2013. LNCS, vol.\u00a0496, pp. 23\u201332. Springer, Heidelberg (1991)"},{"issue":"2-4","key":"66_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K. Deb","year":"2000","unstructured":"Deb, K.: An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering\u00a0186(2-4), 311\u2013338 (2000)","journal-title":"Computer Methods in Applied Mechanics and Engineering"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44739-0_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T13:29:01Z","timestamp":1558963741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44739-0_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44739-0_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}