{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:49:59Z","timestamp":1744202999026},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_9","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T03:39:15Z","timestamp":1187667555000},"page":"121-135","source":"Crossref","is-referenced-by-count":7,"title":["A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Mutsunori","family":"Yagiura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Komiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenya","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Nonobe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1287\/ijoc.1040.0128","volume":"18","author":"J. Cordeau","year":"2006","unstructured":"Cordeau, J., Gaudioso, M., Laporte, G., Moccia, L.: A memetic heuristic for the generalized quadratic assignment problem. INFORMS Journal on Computing\u00a018, 433\u2013443 (2006)","journal-title":"INFORMS Journal on Computing"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","volume":"37","author":"B. Gavish","year":"1991","unstructured":"Gavish, B., Pirkul, H.: Algorithms for the multi-resource generalized assignment problem. Management Science\u00a037, 695\u2013713 (1991)","journal-title":"Management Science"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00175357","volume":"4","author":"F. Glover","year":"1994","unstructured":"Glover, F.: Genetic algorithms and scatter search: unsuspected potentials. Statistics and Computing\u00a04, 131\u2013140 (1994)","journal-title":"Statistics and Computing"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F. Glover","year":"1994","unstructured":"Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms. Discrete Applied Mathematics\u00a049, 231\u2013255 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems, Research Report, University of Colorado, Boulder, CO. Discrete Applied Mathematics\u00a065, 223\u2013253 (1996)","DOI":"10.1016\/0166-218X(94)00037-E"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0120691","volume":"2","author":"T. Ibaraki","year":"1974","unstructured":"Ibaraki, T., Ohashi, T., Mine, H.: A heuristic algorithm for mixed-integer programming problems. Mathematical Programming Study\u00a02, 115\u2013136 (1974)","journal-title":"Mathematical Programming Study"},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search: Methodology and Implementations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., Mart\u00ed, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)"},{"key":"9_CR8","unstructured":"Lee, C., Ma, Z.: The generalized quadratic assignment problem, Technical Report. Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario, Canada (2003)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","volume":"169","author":"R. Mart\u00ed","year":"2006","unstructured":"Mart\u00ed, R., 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":"9_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/S0377-2217(97)00294-4","volume":"106","author":"K. Nonobe","year":"1998","unstructured":"Nonobe, K., Ibaraki, T.: A tabu search approach to the CSP (constraint satisfaction problem) as a general problem solver. European Journal of Operational Research\u00a0106, 599\u2013623 (1998)","journal-title":"European Journal of Operational Research"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-1-4757-3155-2_8","volume-title":"Nonlinear Assignment Problems","author":"S. Voss","year":"2000","unstructured":"Voss, S.: Heuristics for nonlinear assignment problems. In: Pardalos, P.M., Pitsoulis, L.S. (eds.) Nonlinear Assignment Problems, pp. 175\u2013215. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"9_CR12","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.: An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing\u00a016, 133\u2013151 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2004.03.005","volume":"1","author":"M. Yagiura","year":"2004","unstructured":"Yagiura, M., Iwasaki, S., Ibaraki, T., Glover, F.: A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization\u00a01, 87\u201398 (2004)","journal-title":"Discrete Optimization"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:27:51Z","timestamp":1619504871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_9","relation":{},"subject":[]}}