{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:26Z","timestamp":1759335806563},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926948"},{"type":"electronic","value":"9783540926955"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_9","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T05:11:59Z","timestamp":1229404319000},"page":"110-124","source":"Crossref","is-referenced-by-count":21,"title":["Multiobjective Landscape Analysis and the Generalized Assignment Problem"],"prefix":"10.1007","author":[{"given":"Deon","family":"Garrett","sequence":"first","affiliation":[]},{"given":"Dipankar","family":"Dasgupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Boese, K.D.: Cost versus distance in the traveling salesman problem. Technical Report TR-950018, University of California at Los Angeles (1995)","key":"9_CR1"},{"key":"9_CR2","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H. Hoos","year":"2005","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2005)"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"E.D. Weinberger","year":"1990","unstructured":"Weinberger, E.D.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics\u00a063(5), 325\u2013336 (1990)","journal-title":"Biological Cybernetics"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P. Merz","year":"2004","unstructured":"Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation\u00a012(3), 303\u2013325 (2004)","journal-title":"Evolutionary Computation"},{"key":"9_CR5","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"N. Radcliffe","year":"1991","unstructured":"Radcliffe, N.: Forma analysis and random respectful recombination. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufman, San Francisco (1991)"},{"doi-asserted-by":"crossref","unstructured":"Garrett, J.D., Dasgupta, D.: Analyzing the performance of hybrid evolutionary algorithms on the multiobjective quadratic assignment problem. In: Proceedings of the IEEE Congress on Evolutionary Computation (2006)","key":"9_CR6","DOI":"10.1109\/CEC.2006.1688514"},{"unstructured":"Watson, J.P.: Empirical Modeling and Analysis of Local Search Algorithms for the Job-Shop Scheduling Problem. PhD thesis, Colorado State University, Fort Collins, CO (2003)","key":"9_CR7"},{"unstructured":"Watson, J.P., Howe, A., Whitley, L.D.: An analysis of iterated local search for job-shop scheduling. In: Proceedings of the Fifth Metaheuristics International Conference (2003)","key":"9_CR8"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"Journal of the ACM"},{"issue":"2","key":"9_CR10","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(2), 133\u2013151 (2004)","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/S0377-2217(00)00108-9","volume":"132","author":"J.A. D\u00edaz","year":"2001","unstructured":"D\u00edaz, 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"},{"doi-asserted-by":"crossref","unstructured":"Laguna, M., Kelly, J.P., Gonz\u00e1lez-Velarde, J.L., Glover, F.: Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research\u00a082(1) (1995)","key":"9_CR12","DOI":"10.1016\/0377-2217(93)E0174-V"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/10556789808805722","volume":"10","author":"M. Yagiura","year":"1998","unstructured":"Yagiura, M., Yamaguchi, T., Ibaraki, T.: A variable depth search algorithm with branching search for the generalized assignment problem. Optimization Methods and Software\u00a010(3), 419\u2013441 (1998)","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF02085655","volume":"50","author":"M. Racer","year":"1994","unstructured":"Racer, M., Amini, M.M.: A robust heuristic for the generalized assignment problem. Annals of Operations Research\u00a050(1), 487\u2013503 (1994)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"9_CR15","first-page":"209","volume":"9","author":"H.R. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H.R., Serra, D.: Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing\u00a09(3), 209\u2013234 (2002)","journal-title":"Mathware and Soft Computing"},{"issue":"1","key":"9_CR16","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 Generalized Assignment Problem. Computers and Operations Research\u00a024(1), 17\u201323 (1997)","journal-title":"Computers and Operations Research"},{"unstructured":"Alfandari, L., Plateau, A., Tolla, P.: A two-phase path relinking algorithm for the generalized assignment problem. In: Proceedings of the Fourth Metaheuristics International Conference, pp. 175\u2013179 (2001)","key":"9_CR17"},{"key":"9_CR18","first-page":"1","volume-title":"Metaheuristics: Computer Decision-Making","author":"L. Alfandari","year":"2004","unstructured":"Alfandari, L., Plateau, A., Tolla, P.: A path relinking algorithm for the generalized assignment problem. In: Resende, M.G.C., Sousa, J.P. (eds.) Metaheuristics: Computer Decision-Making, pp. 1\u201317. Kluwer Academic Publishers, Dordrecht (2004)"},{"unstructured":"Yagiura, M., Ibaraki, T., Glover, F.: An effective metaheuristic algorithm for the generalized assignment problem. In: 2001 IEEE International Conference on Systems, Man, and Cybernetics, pp. 242\u2013250 (2001)","key":"9_CR19"},{"unstructured":"Yagiura, M., Ibaraki, T., Glover, F.: A path relinking approach for the generalized assignment problem. In: Proceedings of the International Symposium on Scheduling, pp. 105\u2013108 (2002)","key":"9_CR20"},{"key":"9_CR21","first-page":"271","volume-title":"Soft Computing Systems: Design, Management and Applications","author":"J. Knowles","year":"2002","unstructured":"Knowles, J., Corne, D.: Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem. In: Abraham, A., del Solar, J.R., Koppen, M. (eds.) Soft Computing Systems: Design, Management and Applications, pp. 271\u2013279. IOS Press, Amsterdam (2002)"},{"doi-asserted-by":"crossref","unstructured":"Knowles, J., Corne, D.: Instance generators and test suites for the multiobjective quadratic assignment problem. In: Evolutionary Multi-Criterion Optimization (EMO 2003), Second International Conference, pp. 295\u2013310 (2003)","key":"9_CR22","DOI":"10.1007\/3-540-36970-8_21"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:40:00Z","timestamp":1551685200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}