{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:09Z","timestamp":1725488769922},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387719191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-71921-4_6","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T12:26:41Z","timestamp":1186835201000},"page":"113-134","source":"Crossref","is-referenced-by-count":7,"title":["Reviewer Assignment for Scientific Articles using Memetic Algorithms"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Schirrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Amini, M. M.; Racer, M. (1995): \u201cA hybrid heuristic for the generalized assignment problem\u201d. In: European Journal of Operations Research 87 Heuristics: Theory & Applications. Kluwer Academic Publishers, Boston, USA, 343-348.","DOI":"10.1016\/0377-2217(94)00154-5"},{"key":"6_CR2","unstructured":"Baker, J.E. (1987): \u201cReducing Bias and Inefficiency in the Selection Algorithm\u201d. In: Grefenstette, J.J.: Proceedings of the Second International Conference on Genetic Algorithms and their Application, Hillsdale, New Jersey, USA: Lawrence Erlbaum Associates, 1987, 14-21."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","volume":"72","author":"D.G. Cattrysse","year":"1994","unstructured":"Cattrysse, D.G.; Salomon, M.; Van Wassenhove, L.N. (1994): \u201cA set partitioning heuristic for the generalized assignment problem\u201d. In: European Journal of Operations Research 72, 167-174.","journal-title":"European Journal of Operations Research"},{"key":"6_CR4","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. (1997): \u201cA genetic algorithm for the generalized assignment problem\u201d. Computational Operations Research 24, 17-23.","journal-title":"Computational Operations Research"},{"issue":"No.2","key":"6_CR5","first-page":"248","volume":"Vol.19","author":"Edmonds","year":"1972","unstructured":"Edmonds, Jack; Karp, Richard M. (1972): \u201cTheoretical Improvements in Algorithmic Efficiency for Network Flow Problems\u201d. In: Journal of the Association for Computing Machinery, Vol.19, No.2, 248\u2013264.","journal-title":"In: Journal of the Association for Computing Machinery"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0167-6377(99)00047-4","volume":"25","author":"Donald Goldfarb","year":"1999","unstructured":"Goldfarb, Donald; Jin, Zhiying (1999): \u201cA new scaling algorithm for the minimum cost network flow problem\u201d. In: Operations Research Letters 25, Elsevier Science B.V., 205\u2013211.","journal-title":"In: Operations Research Letters"},{"key":"6_CR7","unstructured":"Korte, B.; Vygen, J. (2006): \u201dCombinatorial Optimization: Theory and Algorithms\u201d. 3rd Edition, Springer, 191\u2013214"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M. Laguna","year":"1995","unstructured":"Laguna, M.; Kelly, J.P.; Gonz\u00e1lez-Velarde, J.L.; Glover, F. (1995): \u201cTabu search for the multilevel generalized assignment problem\u201d. European Journal of Operations Research 82, 176-189.","journal-title":"European Journal of Operations Research"},{"key":"6_CR9","first-page":"209","volume":"9","author":"H.R. Lourenco","year":"2002","unstructured":"Lourenco, H.R.; Serra, D. (2002): \u201cAdaptive search heuristics for the generalized assignment problem\u201d. Mathware Soft Computing 9, 209-234.","journal-title":"Mathware Soft Computing"},{"key":"6_CR10","unstructured":"Martello, S.; Toth, P. (1981): \u201cAn algorithm for the generalized assignment problem\u201d. Proceedings of the Ninth IFORS Internat. Conf. on Operational Research. Hamburg, Germany. North\u2013Holland, Amsterdam, The Netherlands, 589-603."},{"key":"6_CR11","first-page":"105","volume-title":"Handbook of Metaheuristics (International Series in Operations Research & Management Science, vol. 57)","author":"P. Moscato","year":"2003","unstructured":"Moscato, P.; Cotta, C. (2003): \u201cA Gentle Introduction To Memetic Algorithms\u201d. In: Glover, Fred, and Kochenberger, Gary A. (eds.): Handbook of Metaheuristics. (International Series in Operations Research & Management Science, vol. 57). Kluwer Academic Publishers, Boston, USA, 105\u2013144."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1287\/ijoc.15.3.249.16075","volume":"15","author":"R.M. Nauss","year":"2003","unstructured":"Nauss, R.M. (2003):\u201c\u2018Solving the generalized assignment problem: An optimizing and heuristic approach\u201d\u2019. INFORMS Journal on Computing 15, 249-266.","journal-title":"INFORMS Journal on Computing"},{"issue":"Issue 2","key":"6_CR13","first-page":"338","volume":"41","author":"J.B. Orlin","year":"1993","unstructured":"Orlin, J.B. (1993): \u201cA faster strongly polynomial minimum cost flow algorithm\u201d. In: Operations Research, Vol.41,Issue 2, 338\u2013350.","journal-title":"In: Operations Research"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"I.H. Osman","year":"1995","unstructured":"Osman, I.H. (1995): \u201cHeuristics for the generalized assignment problem: Simulated annealing and tabu search approaches\u201d. OR Spektrum 17, 211-225.","journal-title":"OR Spektrum"},{"key":"6_CR15","first-page":"219","volume-title":"Handbook of Metaheuristics (International Series in Operations Research & Management Science, vol. 57)","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C.; Ribeiro, C.C. (2003): \u201cGreedy Randomized Adaptive Search Procedures\u201d. In: Glover, Fred, and Kochenberger, Gary A. (eds.): Handbook of Metaheuristics. (International Series in Operations Research & Management Science, vol. 57). Kluwer Academic Publishers, Boston, USA, 219\u2013249."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M.W.P. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.W.P. (1997): \u201cA branch-and-price algorithm for the generalized assignment problem\u201d. Operations Research 45, 831\u2013841","journal-title":"Operations Research"},{"issue":"no. 2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M. Yagiura","year":"2004","unstructured":"Yagiura, M.; Ibaraki, T.; Glover, F. (2004): \u201cAn Ejection Chain Approach for the Generalized Assignment Problem\u201d. In: INFORMS (INFORMS Journal of Computing , vol.16, no. 2), 133\u2013151.","journal-title":"INFORMS (INFORMS Journal of Computing"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M. Yagiura","year":"2006","unstructured":"Yagiura, M.; Ibaraki, T.; Glover, F. (2006): \u201cA Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem\u201d. European Journal of Operational Research, 169, 548\u2013569.","journal-title":"European Journal of Operational Research"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/978-1-4615-5775-3_31","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"M. Yagiura","year":"1999","unstructured":"Yagiura, M.; Yamaguchi, T.; Ibaraki, T. (1999): \u201cA variable depth search algorithm for the generalized assignment problem\u201d. In: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, USA, 459\u2013471."}],"container-title":["Operations Research\/Computer Science Interfaces Series","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-71921-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T22:12:58Z","timestamp":1605651178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-71921-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387719191"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-71921-4_6","relation":{},"subject":[]}}