{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:21:38Z","timestamp":1725531698659},"publisher-location":"Berlin, Heidelberg","reference-count":72,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010842"},{"type":"electronic","value":"9783642010859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01085-9_4","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T12:55:34Z","timestamp":1241441734000},"page":"75-100","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid GRASP Heuristics"],"prefix":"10.1007","author":[{"given":"Paola","family":"Festa","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/002075400189464","volume":"38","author":"S. Abdinnour-Helm","year":"2000","unstructured":"Abdinnour-Helm, S., Hadley, S.W.: Tabu search based heuristics for multi-floor facility layout. International J. of Production Research\u00a038, 365\u2013383 (2000)","journal-title":"International J. of Production Research"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math.\u00a0123, 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R.K. Ahuja","year":"2001","unstructured":"Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming\u00a091, 71\u201397 (2001)","journal-title":"Mathematical Programming"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"R.K. Ahuja","year":"2000","unstructured":"Ahuja, R.K., Orlin, J.B., Tiwari, A.: A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research\u00a027, 917\u2013934 (2000)","journal-title":"Computers and Operations Research"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R. Aiex","year":"2005","unstructured":"Aiex, R., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: GRASP with path relinking for three-index assignment. INFORMS J. on Computing\u00a017(2), 224\u2013247 (2005)","journal-title":"INFORMS J. on Computing"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10732-005-1509-4","volume":"11","author":"A.M. Alvarez","year":"2005","unstructured":"Alvarez, A.M., Gonzalez-Velarde, J.L., De Alba, K.: GRASP embedded scatter search for the multicommodity capacitated network design problem. J. of Heuristics\u00a011, 233\u2013257 (2005)","journal-title":"J. of Heuristics"},{"unstructured":"Andrade, D.V., Resende, M.G.C.: A GRASP for PBX telephone migration scheduling. In: Eighth INFORMS Telecommunication Conference (April 2006)","key":"4_CR7"},{"unstructured":"Baum, E.B.: Iterated descent: A better algorithm for local search in combinatorial optimization problems. Technical report, California Institute of Technology (1986)","key":"4_CR8"},{"unstructured":"Beltr\u00e1n, J.D., Calder\u00f3n, J.E., Cabrera, R.J., P\u00e9rez, J.A.M., Moreno-Vega, J.M.: GRASP\/VNS hybrid for the strip packing problem. In: Proceedings of Hybrid Metaheuristics (HM 2004), pp. 79\u201390 (2004)","key":"4_CR9"},{"key":"4_CR10","first-page":"58","volume-title":"Essays and surveys on metaheuristics","author":"S. Binato","year":"2002","unstructured":"Binato, S., Hery, W.J., Loewenstern, D., Resende, M.G.C.: A greedy randomized adaptive search procedure for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys on metaheuristics, pp. 58\u201379. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4615-1507-4_4","volume-title":"Essays and surveys on metaheuristics","author":"S. Binato","year":"2002","unstructured":"Binato, S., Oliveira, G.C.: A Reactive GRASP for transmission network expansion planning. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys on metaheuristics, pp. 81\u2013100. Kluwer Academic Publishers, Dordrecht (2002)"},{"unstructured":"Bresina, J.L.: Heuristic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), pp. 271\u2013278 (1996)","key":"4_CR12"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks\u00a038, 50\u201358 (2001)","journal-title":"Networks"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks\u00a038, 50\u201358 (2001)","journal-title":"Networks"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"Charon, I., Hudry, O.: The noising method: A new method for combinatorial optimization. Operations Research Letters\u00a014, 133\u2013137 (1993)","journal-title":"Operations Research Letters"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4615-1507-4_12","volume-title":"Essays and surveys on metaheuristics","author":"I. Charon","year":"2002","unstructured":"Charon, I., Hudry, O.: The noising methods: A survey. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys on metaheuristics, pp. 245\u2013261. Kluwer Academic Publishers, Dordrecht (2002)"},{"unstructured":"de la Pe\u00f1a, M.G.B.: Heuristics and metaheuristics approaches used to solve the rural postman problem: A comparative case study. In: Proceedings of the Fourth International ICSC Symposium on Engineering of Intelligent Systems (EIS 2004) (2004)","key":"4_CR17"},{"key":"4_CR18","first-page":"194","volume":"37","author":"H. Delmaire","year":"1999","unstructured":"Delmaire, H., D\u00edaz, J.A., Fern\u00e1ndez, E., Ortega, M.: Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR\u00a037, 194\u2013225 (1999)","journal-title":"INFOR"},{"key":"4_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","volume":"178","author":"A. Duarte","year":"2007","unstructured":"Duarte, A., Mart\u00ed, R.: Tabu search and GRASP for the maximum diversity problem. European J. of Operational Research\u00a0178(1), 71\u201384 (2007)","journal-title":"European J. of Operational Research"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters\u00a08, 67\u201371 (1989)","journal-title":"Operations Research Letters"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"J. of Global Optimization"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-71615-0_6","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"S. Fernandes","year":"2007","unstructured":"Fernandes, S., Louren\u00e7o, H.R.: A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol.\u00a04446, pp. 60\u201371. Springer, Heidelberg (2007)"},{"key":"4_CR24","first-page":"1","volume":"11","author":"P. Festa","year":"2006","unstructured":"Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: GRASP with path-relinking for the weighted MAXSAT problem. ACM J. of Experimental Algorithmics\u00a011, 1\u201316 (2006)","journal-title":"ACM J. of Experimental Algorithmics"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"7","author":"P. Festa","year":"2002","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software\u00a07, 1033\u20131058 (2002)","journal-title":"Optimization Methods and Software"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and Surveys on Metaheuristics","author":"P. Festa","year":"2002","unstructured":"Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325\u2013367. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"4_CR27","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"key":"4_CR28","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search \u2013 Part I. ORSA J. on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA J. on Computing"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search \u2013 Part II. ORSA J. on Computing\u00a02, 4\u201332 (1990)","journal-title":"ORSA J. on Computing"},{"key":"4_CR30","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programing \u2013 Advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer, Dordrecht (1996)"},{"key":"4_CR31","first-page":"1","volume-title":"Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"2000","unstructured":"Glover, F.: Multi-start and strategic oscillation methods \u2013 Principles to exploit adaptive memory. In: Laguna, M., Gonz\u00e1les-Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 1\u201324. Kluwer, Dordrecht (2000)"},{"key":"4_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"4_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"4_CR34","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics\u00a039, 653\u2013684 (2000)","journal-title":"Control and Cybernetics"},{"key":"4_CR35","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/978-3-642-18965-4_20","volume-title":"Advances in Evolutionary Computation: Theory and Applications","author":"F. Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter Search. In: Ghosh, A., Tsutsui, S. (eds.) Advances in Evolutionary Computation: Theory and Applications, pp. 519\u2013537. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"4_CR36","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)"},{"key":"4_CR37","first-page":"433","volume-title":"Meta-heuristics, Advances and trends in local search paradigms for optimization","author":"P. Hansen","year":"1998","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, Advances and trends in local search paradigms for optimization, pp. 433\u2013458. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"4_CR38","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/978-1-4615-1507-4_19","volume-title":"Essays and Surveys in Metaheuristics","author":"P. Hansen","year":"2002","unstructured":"Hansen, P., Mladenovi\u0107, N.: Developments of variable neighborhood search. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 415\u2013439. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: An empirical study. Operations Research Letters\u00a06, 107\u2013114 (1987)","journal-title":"Operations Research Letters"},{"key":"4_CR40","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, Ann Arbor (1975)"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/11890584_5","volume-title":"Hybrid Metaheuristics","author":"L. Jourdan","year":"2006","unstructured":"Jourdan, L., Dhaenens, C., Talbi, E.-G.: Using datamining techniques to help metaheuristics: A short survey. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., P\u00e9rez P\u00e9rez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol.\u00a04030, pp. 57\u201369. Springer, Heidelberg (2006)"},{"issue":"2","key":"4_CR42","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning problems. Bell System Technical Journal\u00a049(2), 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"4_CR43","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S. Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S.: Optimization by simulated annealing: Quantitative studies. J. of Statistical Physics\u00a034, 975\u2013986 (1984)","journal-title":"J. of Statistical Physics"},{"key":"4_CR44","volume-title":"Genetic Programming III, Darwinian Invention and Problem Solving","author":"J.R. Koza","year":"1999","unstructured":"Koza, J.R., Bennett III, F.H., Andre, D., Keane, M.A.: Genetic Programming III, Darwinian Invention and Problem Solving. Morgan Kaufmann Publishers, San Francisco (1999)"},{"key":"4_CR45","first-page":"183","volume-title":"Handbook of Applied Optimization","author":"M. Laguna","year":"2002","unstructured":"Laguna, M.: Scatter Search. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 183\u2013193. Oxford University Press, Oxford (2002)"},{"key":"4_CR46","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. on Computing\u00a011, 44\u201352 (1999)","journal-title":"INFORMS J. on Computing"},{"key":"4_CR47","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, Dordrecht (2003)"},{"unstructured":"Lim, A., Wang, F.: A smoothed dynamic tabu search embedded GRASP for m-VRPTW. In: Proceedings of ICTAI 2004, pp. 704\u2013708 (2004)","key":"4_CR48"},{"key":"4_CR49","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"4_CR50","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1026546708757","volume":"17","author":"S.L. Martins","year":"2000","unstructured":"Martins, S.L., Resende, M.G.C., Ribeiro, C.C., Pardalos, P.: A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization\u00a017, 267\u2013283 (2000)","journal-title":"Journal of Global Optimization"},{"key":"4_CR51","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"key":"4_CR52","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H., Laporte, G.: Metaheuristics: A bibliography. Annals of Operations Research\u00a063, 513 (1996)","journal-title":"Annals of Operations Research"},{"key":"4_CR53","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. on Computing\u00a012, 164\u2013176 (2000)","journal-title":"INFORMS J. on Computing"},{"unstructured":"Resende, M.G.C., Mart\u00ed, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-min diversity problem. Technical report, AT&T Labs Research, Florham Park, NJ\u2013USA (2008)","key":"4_CR54"},{"key":"4_CR55","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: A GRASP with path-relinking for private virtual circuit routing. Networks\u00a041, 104\u2013114 (2003)","journal-title":"Networks"},{"key":"4_CR56","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"4_CR57","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M.G.C. Resende","year":"2004","unstructured":"Resende, M.G.C., Ribeiro, C.C.: A hybrid heuristic for the p-median problem. J. of Heuristics\u00a010, 59\u201388 (2004)","journal-title":"J. of Heuristics"},{"key":"4_CR58","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M.G.C. Resende","year":"2005","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29\u201363. Springer, Heidelberg (2005)"},{"key":"4_CR59","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","volume":"174","author":"M.G.C. Resende","year":"2006","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. European J. of Operational Research\u00a0174, 54\u201368 (2006)","journal-title":"European J. of Operational Research"},{"key":"4_CR60","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Souza, M.C.: Variable neighborhood search for the degree constrained minimum spanning tree problem. Discrete Applied Mathematics\u00a0118, 43\u201354 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR61","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing\u00a014, 228\u2013246 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"4_CR62","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. on Computing\u00a014, 228\u2013246 (2002)","journal-title":"INFORMS J. on Computing"},{"key":"4_CR63","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2005.03.061","volume":"179","author":"C.C. Ribeiro","year":"2007","unstructured":"Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. European J. of Operational Research\u00a0179, 775\u2013787 (2007)","journal-title":"European J. of Operational Research"},{"key":"4_CR64","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1111\/j.1475-3995.2005.498_1.x","volume":"12","author":"C.C. Ribeiro","year":"2005","unstructured":"Ribeiro, C.C., Vianna, D.S.: A GRASP\/VND heuristic for the phylogeny problem using a new neighborhood structure. Intl. Trans. in Op. Res.\u00a012, 325\u2013338 (2005)","journal-title":"Intl. Trans. in Op. Res."},{"key":"4_CR65","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10852-005-9030-1","volume":"5","author":"M.H. Ribeiro","year":"2006","unstructured":"Ribeiro, M.H., Plastino, A., Martins, S.L.: Hybridization of GRASP metaheuristic with data mining techniques. J. of Mathematical Modelling and Algorithms\u00a05, 23\u201341 (2006)","journal-title":"J. of Mathematical Modelling and Algorithms"},{"unstructured":"Rocha, P.L., Ravetti, M.G., Mateus, G.R.: The metaheuristic GRASP as an upper bound for a branch and bound algorithm in a scheduling problem with non-related parallel machines and sequence-dependent setup times. In: Proceedings of the 4th EU\/ME Workshop: Design and Evaluation of Advanced Hybrid Meta-Heuristics, vol. 1, pp. 62\u201367 (2004)","key":"4_CR66"},{"doi-asserted-by":"crossref","unstructured":"Santos, L.F., Martins, S.L., Plastino, A.: Applications of the DM-GRASP heuristic: A survey. In: International Transactions on Operational Research (2008)","key":"4_CR67","DOI":"10.1111\/j.1475-3995.2008.00644.x"},{"doi-asserted-by":"crossref","unstructured":"Santos, L.F., Milagres, R., Albuquerque, C.V., Martins, S., Plastino, A.: A hybrid GRASP with data mining for efficient server replication for reliable multicast. In: 49th Annual IEEE GLOBECOM Technical Conference (2006)","key":"4_CR68","DOI":"10.1109\/GLOCOM.2006.246"},{"key":"4_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/11546245_11","volume-title":"Hybrid Metaheuristics","author":"L.F. Santos","year":"2005","unstructured":"Santos, L.F., Ribeiro, M.H., Plastino, A., Martins, S.L.: A hybrid GRASP with data mining for the maximum diversity problem. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) HM 2005. LNCS, vol.\u00a03636, pp. 116\u2013127. Springer, Heidelberg (2005)"},{"key":"4_CR70","volume-title":"Approximation and complexity in numerical optimization","author":"D. Sosnowska","year":"2000","unstructured":"Sosnowska, D.: Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP. In: Pardalos, P.M. (ed.) Approximation and complexity in numerical optimization. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"4_CR71","first-page":"627","volume-title":"Metaheuristics: Computer Decision-Making","author":"M.C. Souza","year":"2004","unstructured":"Souza, M.C., Duhamel, C., Ribeiro, C.C.: A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy. In: Resende, M.G.C., Sousa, J. (eds.) Metaheuristics: Computer Decision-Making, pp. 627\u2013658. Kluwer Academic Publishers, Dordrecht (2004)"},{"volume-title":"Meta-heuristics: Andvances and trends in local search paradigms for optimization","year":"1999","unstructured":"Voss, S., Martello, S., Osman, I.H., Roucairo, C. (eds.): Meta-heuristics: Andvances and trends in local search paradigms for optimization. Kluwer Academic Publishers, Dordrecht (1999)","key":"4_CR72"}],"container-title":["Studies in Computational Intelligence","Foundations of Computational Intelligence Volume 3"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01085-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T05:56:38Z","timestamp":1619762198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01085-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010842","9783642010859"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01085-9_4","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}