{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:24:18Z","timestamp":1772303058822,"version":"3.50.1"},"publisher-location":"Boston","reference-count":101,"publisher":"Kluwer Academic Publishers","isbn-type":[{"value":"1402072635","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-306-48056-5_8","type":"book-chapter","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T18:26:26Z","timestamp":1138904786000},"page":"219-249","source":"Crossref","is-referenced-by-count":280,"title":["Greedy Randomized Adaptive Search Procedures"],"prefix":"10.1007","author":[{"given":"Mauricio G. C.","family":"Resende","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/002075400189464","volume":"38","author":"S. Abdinnour-Helm","year":"2000","unstructured":"S. Abdinnour-Helm and S.W. Hadley (2000) Tabu search based heuristics for multi-floor facility layout. International Journal of Production Research, 38, 365\u2013383.","journal-title":"International Journal of Production Research"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"J. Abello, P.M. Pardalos and M.G.C. Resende (1999) On maximum clique problems in very large graphs. In: J. Abello and J. Vitter (eds.), External Memory Algorithms and Visualization, volume 50 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 199\u2013130.","DOI":"10.1090\/dimacs\/050\/06"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"R.K. Ahuja","year":"2000","unstructured":"R.K. Ahuja, J.B. Orlin and A. Tiwari (2000) A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research, 27, 917\u2013934.","journal-title":"Computers and Operations Research"},{"key":"8_CR4","unstructured":"R.M. Aiex, M.G.C. Resende, P.M. Pardalos and G. Toraldo (2000) GRASP with path-relinking for the three-index assignment problem. Technical report, AT&T Labs\u2014Research."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"R,M. Aiex, M.G.C. Resende and C.C. Ribeiro (2002) Probability distribution of solution time in GRASP: an experimental investigation. Journal of Heuristics, 8, 343\u2013373.","journal-title":"Journal of Heuristics"},{"key":"8_CR6","volume-title":"Parallelization strategies for the metaheuristic GRASP","author":"A.C. Alvim","year":"1998","unstructured":"A.C. Alvim (1998) Parallelization strategies for the metaheuristic GRASP. Master\u2019s thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Brazil (in Portuguese)."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A.C. Alvim and C.C. Ribeiro (1998) Load balancing for the parallelization of the GRASP metaheuristic. In: Proceedings of the X Brazilian Symposium on Computer Architecture, B\u00fazios, pp. 279\u2013282 (in Portuguese).","DOI":"10.5753\/sbac-pad.1998.22696"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"S. Areibi and A. Vannelli (1997) A GRASP clustering technique for circuit partitioning. In: J. Gu and P.M. Pardalos (eds.), Satisfiability Problems, Volume 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 711\u2013724.","DOI":"10.1090\/dimacs\/035\/23"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1009772208981","volume":"1","author":"M.F. Arg\u00fcello","year":"1997","unstructured":"M.F. Arg\u00fcello, J.F. Bard and G. Yu (1997) A GRASP for aircraft routing in response to groundings and delays. Journal of Combinatorial Optimization, 1, 211\u2013228.","journal-title":"Journal of Combinatorial Optimization"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0305-0548(95)E0020-L","volume":"23","author":"M.F. Arg\u00fcello","year":"1996","unstructured":"M.F. Arg\u00fcello, T.A. Feo and O. Goldschmidt (1996) Randomized methods for the number partitioning problem. Computers and Operations Research, 23, 103\u2013111.","journal-title":"Computers and Operations Research"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1009665726946","volume":"6","author":"M. Armony","year":"2000","unstructured":"M. Armony, J.C. Klincewicz, H. Luss and M.B. Rosenwein (2000) Design of stacked self-healing rings using a genetic algorithm. Journal of Heuristics, 6, 85\u2013105.","journal-title":"Journal of Heuristics"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1038\/sj.jors.2600521","volume":"49","author":"J.B. Atkinson","year":"1998","unstructured":"J.B. Atkinson (1998) A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. Journal of the Operational Research Society, 49, 700\u2013708.","journal-title":"Journal of the Operational Research Society"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/mnsc.35.2.249","volume":"35","author":"J.F. Bard","year":"1989","unstructured":"J.F. Bard and T.A. Feo (1989) Operations sequencing in discrete parts manufacturing. Management Science, 35, 249\u2013255.","journal-title":"Management Science"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1080\/07408179108963843","volume":"23","author":"J.F. Bard","year":"1991","unstructured":"J.F. Bard and T.A. Feo (1991) An algorithm for the manufacturing equipment selection problem. IIE Transactions, 23, 83\u201392.","journal-title":"IIE Transactions"},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/07408179608966261","volume":"28","author":"J.F. Bard","year":"1996","unstructured":"J.F. Bard, T.A. Feo and S. Holland (1996) A GRASP for scheduling printed wiring board assembly. IIE Transactions, 28, 155\u2013165.","journal-title":"IIE Transactions"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/trsc.32.2.189","volume":"32","author":"J.F. Bard","year":"1998","unstructured":"J.F. Bard, L. Huang, P. Jaillet and M. Dror (1998) A decomposition approach to the inventory routing problem with satellite facilities. Transportation Science, 32, 189\u2013203.","journal-title":"Transportation Science"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0141-9331(92)90003-C","volume":"16","author":"R. Battiti","year":"1992","unstructured":"R. Battiti and G. Tecchiolli (1992) Parallel biased search for combinatorial optimization: Genetic algorithms and tabu. Microprocessors and Microsystems, 16, 351\u2013367.","journal-title":"Microprocessors and Microsystems"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley (1990) OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"S. Binato, W.J. Hery, D, Loewenstern and M.G.C. Resende (2002) A GRASP for job shop scheduling. In: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 59\u201379.","DOI":"10.1007\/978-1-4615-1507-4_3"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"S. Binato and G.C. Oliveira (2002) A reactive GRASP for transmission network expansion planning. In: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 81\u2013100.","DOI":"10.1007\/978-1-4615-1507-4_4"},{"key":"8_CR21","unstructured":"J.L. Bresina (1996) Heuristic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence. Portland, pp. 271\u2013278."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"S.A. Canuto, M.G.C. Resende and C.C. Ribeiro (2001) Local search with perturbations for the prize-collecting Steinertree problem in graphs. Networks, 38, 50\u201358.","journal-title":"Networks"},{"key":"8_CR23","unstructured":"S.A. Canuto, C.C. Ribeiro and M.G.C. Resende (1999) Local search with perturbations for the prize-collecting Steiner tree problem. In: Extended Abstracts of the Third Metaheuristics International Conference. Angra dos Reis, pp. 115\u2013119."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"C. Carreto and B. Baker (2002) A GRASP interactive approach to the vehicle routing problem with backhauls. In: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 185\u2013199.","DOI":"10.1007\/978-1-4615-1507-4_9"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I. Charon","year":"1993","unstructured":"I. Charon and O. Hudry (1993) The noising method: a new method for combinatorial optimization. Operations Research Letters, 14, 133\u2013137.","journal-title":"Operations Research Letters"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"I. Charon and O. Hudry (2002) The noising methods: a survey. In: C.C. Ribeiro and C.C. Ribeiro (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 245\u2013261.","DOI":"10.1007\/978-1-4615-1507-4_12"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"V.-D. Cung, S.L. Martins, C.C. Ribeiro and C. Roucairol (2002) Strategies for the parallel implementation of metaheuristics. In: C.C. Ribeiro and C.C. Ribeiro (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 263\u2013308.","DOI":"10.1007\/978-1-4615-1507-4_13"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0925-5273(94)90034-5","volume":"34","author":"P. De","year":"1994","unstructured":"P. De, J.B. Ghosj and C.E. Wells (1994) Solving a generalized model for con due date assignment and sequencing. International Journal of Production Economics, 34, 179\u2013185.","journal-title":"International Journal of Production Economics"},{"key":"8_CR29","first-page":"194","volume":"37","author":"H. Delmaire","year":"1999","unstructured":"H. Delmaire, J.A. D\u00edaz, E. Fern\u00e1ndez and M. Ortega (1999) Reactive GRASP and Tabu Search based heuristics for the single source capacitated plant location problem. INFOR, 37, 194\u2013225.","journal-title":"INFOR"},{"key":"8_CR30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0895-7177(97)00255-0","volume":"27","author":"A.S. Deshpande","year":"1998","unstructured":"A.S. Deshpande and E. Triantaphyllou (1998) A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions. Mathematical Computer Modelling, 27, 75\u201399.","journal-title":"Mathematical Computer Modelling"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0167-8191(90)90063-F","volume":"16","author":"N. Dodd","year":"1990","unstructured":"N. Dodd (1990) Slow annealing versus multiple fast annealing runs: an empirical investigation. Parallel Computing, 16, 269\u2013272.","journal-title":"Parallel Computing"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0377-2217(96)00209-3","volume":"102","author":"A. Drexl","year":"1997","unstructured":"A. Drexl and F. Salewski (1997) Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research, 102, 193\u2013214.","journal-title":"European Journal of Operational Research"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"H.T. Eikelder, M. Verhoeven, T. Vossen and E. Aarts (1996) A probabilistic analysis of local search. In: I. Osman and J. Kelly (eds.), Metaheuristics: Theory and Applications. Kluwer Academic Publishers, pp. 605\u2013618.","DOI":"10.1007\/978-1-4613-1361-8_36"},{"key":"8_CR34","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1287\/mnsc.35.12.1415","volume":"35","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and J.F. Bard (1989) Flight scheduling and maintenance base planning. Management Science, 35, 1415\u20131432.","journal-title":"Management Science"},{"key":"8_CR35","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0278-6125(89)90016-2","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and J.F. Bard (1989) The cutting path and tool selection problem in computer-aided process planning. Journal ofManufacturing Systems, 8, 17\u201326.","journal-title":"Journal ofManufacturing Systems"},{"key":"8_CR36","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.43.2.219","volume":"43","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo, J.F. Bard and S. Holland (1995) Facility-wide planning and scheduling of printed wiring board assembly. Operations Research, 43, 219\u2013230.","journal-title":"Operations Research"},{"key":"8_CR37","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/trsc.29.4.330","volume":"29","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo and J.L. Gonz\u00e1lez-Velarde (1995) The intermodal trailer assignment problem: models, algorithms, and heuristics. Transportation Science, 29, 330\u2013341.","journal-title":"Transportation Science"},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and M.G.C. Resende (1989) A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"8_CR39","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo and M.G.C. Resende (1995) Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"8_CR40","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"T.A. Feo, M.G.C. Resende and S.H. Smith (1994) A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42, 860\u2013878.","journal-title":"Operations Research"},{"key":"8_CR41","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/0305-0548(95)00084-4","volume":"23","author":"T.A. Feo","year":"1996","unstructured":"T.A. Feo, K. Sarathy and J. McGahan (1996) A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties. Computers and Operations Research, 23, 881\u2013895.","journal-title":"Computers and Operations Research"},{"key":"8_CR42","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","volume":"18","author":"T.A. Feo","year":"1991","unstructured":"T.A. Feo, K. Venkatraman and J.F. Bard (1991) A GRASP for a difficult single machine scheduling problem. Computers and Operations Research, 18, 635\u2013643.","journal-title":"Computers and Operations Research"},{"key":"8_CR43","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1009633811636","volume":"5","author":"E. Fern\u00e1ndez","year":"1999","unstructured":"E. Fern\u00e1ndez and R. Mart\u00ed (1999) GRASP for seam drawing in mosaicking of aerial photographic maps. Journal of Heuristics, 5, 181\u2013197.","journal-title":"Journal of Heuristics"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"P. Festa and M.G.C. Resende (2002) GRASP: an annotated bibliography. In: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 325\u2013367.","DOI":"10.1007\/978-1-4615-1507-4_15"},{"key":"8_CR45","unstructured":"P. Festa, M.G.C. Resende, P. Pardalos and C.C. Ribeiro (2001) GRASP and VNS for Max-Cut. In: Extended Abstracts of the Fourth Metaheuristics International Conference. Porto, pp. 371\u2013376."},{"key":"8_CR46","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"C. Fleurent and F. Glover (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"8_CR47","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0167-6377(96)00025-9","volume":"19","author":"J.B. Ghosh","year":"1996","unstructured":"J.B. Ghosh (1996) Computatinal aspects of the maximum diversity problem. Operations Research Letters, 19, 175\u2013181.","journal-title":"Operations Research Letters"},{"key":"8_CR48","unstructured":"F. Glover (1996) Tabu search and adaptive memory programming\u2014advances, applications and challenges. In: R.S. Barr, R.V. Helgason and J.L. Kennington (eds.), Interfaces in Computer Science and Operations Research. Kluwer, pp. 1\u201375."},{"key":"8_CR49","doi-asserted-by":"crossref","unstructured":"F. Glover (2000) Multi-start and strategic oscillation methods\u2014principles to exploit adaptive memory. In: M. Laguna and J.L. Gonz\u00e1les-Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer, pp. 1\u201324.","DOI":"10.1007\/978-1-4615-4567-5_1"},{"key":"8_CR50","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna (1997) Tabu Search. Kluwer.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"8_CR51","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"F. Glover, M. Laguna and R. Mart\u00ed (2000) Fundamentals of scatter search and path relinking. Control and Cybernetics, 39, 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"8_CR52","unstructured":"M.X. Goemans and D.P. Williamson (1996) The primal dual method for approximation algorithms and its application to network design problems. In: D. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems. PWS Publishing Co., pp. 144\u2013191."},{"key":"8_CR53","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1009687403254","volume":"7","author":"P.L. Hammer","year":"2001","unstructured":"P.L. Hammer and D.J. Rader, Jr. (2001) Maximally disjoint solutions of the set covering problem. Journal of Heuristics, 7, 131\u2013144.","journal-title":"Journal of Heuristics"},{"key":"8_CR54","doi-asserted-by":"crossref","unstructured":"P. Hansen and N. Mladenovi\u0107 (2002) Developments of variable neighborhood search. In: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, pp. 415\u2013439.","DOI":"10.1007\/978-1-4615-1507-4_19"},{"key":"8_CR55","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"J.P. Hart and A.W. Shogan (1987) Semi-greedy heuristics: an empirical study. Operations Research Letters, 6, 107\u2013114.","journal-title":"Operations Research Letters"},{"key":"8_CR56","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H. Hoos","year":"1999","unstructured":"H. Hoos and T. St\u00fctzle (1999) Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence, 112, 213\u2013232.","journal-title":"Artificial Intelligence"},{"key":"8_CR57","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02060483","volume":"40","author":"J.G. Klincewicz","year":"1992","unstructured":"J.G. Klincewicz (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals of Operations Research, 40, 283\u2013302.","journal-title":"Annals of Operations Research"},{"key":"8_CR58","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1002\/1520-6750(199412)41:7<893::AID-NAV3220410704>3.0.CO;2-R","volume":"41","author":"J.G. Klincewicz","year":"1994","unstructured":"J.G. Klincewicz and A. Rajan (1994) Using GRASP to solve the component grouping problem. Naval Research Logistics, 41, 893\u2013912.","journal-title":"Naval Research Logistics"},{"key":"8_CR59","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G. Kontoravdis","year":"1995","unstructured":"G. Kontoravdis and J.F. Bard (1995) A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing, 7, 10\u201323.","journal-title":"ORSA Journal on Computing"},{"key":"8_CR60","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.42.4.677","volume":"42","author":"M. Laguna","year":"1994","unstructured":"M. Laguna, T.A. Feo and H.C. Elrod (1994) A greedy randomized adaptive search procedure for the two-partition problem. Operations Research, 42, 677\u2013687.","journal-title":"Operations Research"},{"key":"8_CR61","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01471113","volume":"2","author":"M. Laguna","year":"1991","unstructured":"M. Laguna and J.L. Gonz\u00e1lez-Velarde (1991) A search heuristic for just-in-time scheduling in parallel machines. Journal of Intelligent Manufacturing, 2, 253\u2013260.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"8_CR62","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"M. Laguna and R. Mart\u00ed (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11, 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"key":"8_CR63","doi-asserted-by":"crossref","unstructured":"Y. Li, P.M. Pardalos and M.G.C. Resende (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: P.M. Pardalos and H. Wolkowicz (eds.), Quadratic Assignment and Related Problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 237\u2013261.","DOI":"10.1090\/dimacs\/016\/12"},{"key":"8_CR64","doi-asserted-by":"crossref","unstructured":"X. Liu, P.M. Pardalos, S. Rajasekaran and M.G.C. Resende (2000) A GRASP for frequency assignment in mobile radio networks. In: B.R. Badrinath, F. Hsu, P.M. Pardalos and S. Rajasekaran (eds.), Mobile Networks and Computing, volume 52 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 195\u2013201.","DOI":"10.1090\/dimacs\/052\/12"},{"key":"8_CR65","unstructured":"S.L. Martins, P.M. Pardalos, M.G.C. Resende and C.C. Ribeiro (1999) Greedy randomized adaptive search procedures for the steiner problem in graphs. In: P.M. Pardalos, S. Rajasekaran and J. Rolim (eds.), Randomization Methods in Algorithmic Design, volume 43 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 133\u2013145."},{"key":"8_CR66","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1026546708757","volume":"17","author":"S.L. Martins","year":"2000","unstructured":"S.L. Martins, M.G.C. Resende, C.C. Ribeiro and P. Pardalos (2000) A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization, 17, 267\u2013283.","journal-title":"Journal of Global Optimization"},{"key":"8_CR67","doi-asserted-by":"crossref","unstructured":"S.L. Martins, C.C. Ribeiro and M.C. Souza (1998) A parallel GRASP for the Steiner problem in graphs. In: A. Ferreira and J. Rolim (eds.), Proceedings of IRREGULAR\u201998\u20145th International Symposium on Solving Irregularly Structured Problems in Parallel, volume 1457 of Lecture Notes in Computer Science. Springer-Verlag, pp. 285\u2013297.","DOI":"10.1007\/BFb0018547"},{"key":"8_CR68","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0377-2217(97)00083-0","volume":"105","author":"T. Mavridou","year":"1998","unstructured":"T. Mavridou, P.M. Pardalos, L.S. Pitsoulis and M.G.C. Resende (1998) A GRASP for the biquadratic assignment problem. European Journal of Operational Research, 105, 613\u2013621.","journal-title":"European Journal of Operational Research"},{"key":"8_CR69","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"N. Mladenovi\u0107 and P. Hansen (1997) Variable neighborhood search. Computers and Operations Research, 24, 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"8_CR70","unstructured":"R. A. Murphey, P.M. Pardalos and L.S. Pitsoulis (1998) A parallel GRASP for the data association multidimensional assignment problem. In: P.M. Pardalos (ed.), Parallel Processing of Discrete Problems, volume 106 of The IMA Volumes in Mathematics and Its Applications, Springer-Verlag, pp. 159\u2013180."},{"key":"8_CR71","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L. Osborne","year":"1991","unstructured":"L. Osborne and B. Gillett (1991) A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing, 3, 213\u2013225.","journal-title":"ORSA Journal on Computing"},{"key":"8_CR72","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1009736921890","volume":"2","author":"P.M. Pardalos","year":"1999","unstructured":"P.M. Pardalos, T. Qian and M.G.C. Resende (1999) A greedy randomized adaptive search procedure for the feedback vertex set problem. Journal of Combinatorial Optimization, 2, 399\u2013412.","journal-title":"Journal of Combinatorial Optimization"},{"key":"8_CR73","doi-asserted-by":"crossref","unstructured":"P.M. Pardalos, L.S. Pitsoulis and M.G.C. Resende (1995) A parallel GRASP implementation for the quadratic assignment problem. In: A. Ferreira and J. Rolim (eds.), Parallel Algorithms for Irregularly Structured Problems\u2014Irregular\u201994.Kluwer Academic Publishers, pp. 115\u2013133.","DOI":"10.1007\/978-1-4757-6130-6_6"},{"key":"8_CR74","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/3-540-62095-8_62","volume":"1184","author":"P.M. Pardalos","year":"1996","unstructured":"P.M. Pardalos, L.S. Pitsoulis and M.G.C. Resende (1996) A parallel GRASP for MAX-SAT problems. Lecture Notes in Computer Science, 1184, 575\u2013585.","journal-title":"Lecture Notes in Computer Science"},{"key":"8_CR75","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0377-2217(00)00029-1","volume":"130","author":"L.S. Pitsoulis","year":"2001","unstructured":"L.S. Pitsoulis, P.M. Pardalos and D.W. Hearn (2001) Approximate solutions to the turbine balancing problem. European Journal of Operational Research, 130, 147\u2013155.","journal-title":"European Journal of Operational Research"},{"key":"8_CR76","unstructured":"M. Prais and C.C. Ribeiro (1999) Parameter variation in GRASP implementations. In: Extended Abstracts of the Third Metaheuristics International Conference. Angra dos Reis, pp. 375\u2013380."},{"key":"8_CR77","first-page":"1","volume":"9","author":"M. Prais","year":"2000","unstructured":"M. Prais and C.C. Ribeiro (2000) Parameter variation in GRASP procedures. Investigaci\u00f3nOperativa, 9, 1\u201320.","journal-title":"Investigaci\u00f3nOperativa"},{"key":"8_CR78","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"M. Prais and C.C. Ribeiro (2000) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12, 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"8_CR79","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M.G.C. Resende","year":"1998","unstructured":"M.G.C. Resende (1998) Computing approximate solutions of the maximum covering problem using GRASP. Journal of Heuristics, 4, 161\u2013171.","journal-title":"Journal of Heuristics"},{"key":"8_CR80","doi-asserted-by":"crossref","unstructured":"M.G.C. Resende and T.A. Feo (1996) A GRASP for satisfiability. In: D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, volume 26 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 499\u2013520.","DOI":"10.1090\/dimacs\/026\/24"},{"key":"8_CR81","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1145\/293686.293690","volume":"24","author":"M.G.C. Resende","year":"1998","unstructured":"M.G.C. Resende, T.A. Feo and S.H. Smith (1998) Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Transactions on Mathematical Software, 24, 386\u2013394.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"8_CR82","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/225545.225553","volume":"22","author":"M.G.C. Resende","year":"1996","unstructured":"M.G.C. Resende, P.M. Pardalos and Y. Li (1996) Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, 22, 104\u2013118.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"8_CR83","doi-asserted-by":"crossref","unstructured":"M.G.C. Resende, L.S. Pitsoulis and P.M. Pardalos (1997) Approximate solution of weighted MAX-SAT problems using GRASP. In: J. Gu and P.M. Pardalos (eds.), Satisfiability Problems, volume 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 393\u2013405.","DOI":"10.1090\/dimacs\/035\/11"},{"key":"8_CR84","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0166-218X(99)00171-7","volume":"100","author":"M.G.C. Resende","year":"2000","unstructured":"M.G.C. Resende, L.S. Pitsoulis and P.M. Pardalos (2000) Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discrete Applied Mathematics, 100, 95\u2013113.","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR85","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E","volume":"29","author":"M.G.C. Resende","year":"1997","unstructured":"M.G.C. Resende and C.C. Ribeiro (1997) A GRASP for graph planarization. Networks, 29, 173\u2013189.","journal-title":"Networks"},{"key":"8_CR86","unstructured":"M.G.C. Resende and C.C. Ribeiro (2001) A GRASP with path-relinking for private virtual circuit routing. Technical report, AT&T Labs Research."},{"key":"8_CR87","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1145\/326147.326153","volume":"25","author":"C.C. Ribeiro","year":"1999","unstructured":"C.C. Ribeiro and M.G.C. Resende (1999) Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Transactions on Mathematical Software, 25, 342\u2013352.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"8_CR88","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1009670031749","volume":"3","author":"C.C. Ribeiro","year":"1997","unstructured":"C.C. Ribeiro, C.D. Ribeiro and R.S. Lanzelotte (1997) Query optimization in distributed relational databases. Journal of Heuristics, 3, 5\u201323.","journal-title":"Journal of Heuristics"},{"key":"8_CR89","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"C.C. Ribeiro","year":"2002","unstructured":"C.C. Ribeiro and M.C. Souza (2002) Variable neighborhood search forthe degree constrained minimum spanning tree problem. Discrete Applied Mathematics, 118, 43\u201354.","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR90","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"C.C. Ribeiro, E. Uchoa and R.F. Werneck (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14, 228\u2013246.","journal-title":"INFORMS Journal on Computing"},{"key":"8_CR91","doi-asserted-by":"crossref","unstructured":"R.Z. R\u00edos-Mercado and J.F. Bard (1998) Heuristics for the flow line problem with setup costs. European Journal of Operational Research, 76\u201398.","DOI":"10.1016\/S0377-2217(97)00213-0"},{"key":"8_CR92","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1009691028143","volume":"5","author":"R.Z. R\u00edos-Mercado","year":"1999","unstructured":"R.Z. R\u00edos-Mercado and J.F. Bard (1999) An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup costs. Journal of Heuristics, 5, 57\u201374.","journal-title":"Journal of Heuristics"},{"key":"8_CR93","unstructured":"B. Selman, H. Kautz and B. Cohen (1994) Noise strategies for improving local search. In: Proceedings of the Twelfth National Conference on Artificial Intelligence. Seattle, MIT Press, pp. 337\u2013343."},{"key":"8_CR94","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"7","author":"E. Taillard","year":"1991","unstructured":"E. Taillard (1991) Robust taboo search forthe quadratic assignment problem. Parallel Computing, 7, 443\u2013455.","journal-title":"Parallel Computing"},{"key":"8_CR95","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyama (1980) An approximate solution for the Steiner problem in graphs. Mathematica Japonica, 24, 573\u2013577.","journal-title":"Mathematica Japonica"},{"key":"8_CR96","doi-asserted-by":"crossref","unstructured":"T.L. Urban (1998) Solution procedures for the dynamic facility layout problem. Annals of Operations Research, 323\u2013342.","DOI":"10.1023\/A:1018904806854"},{"key":"8_CR97","doi-asserted-by":"crossref","unstructured":"T.L. Urban, W.-C. Chiang and R.A. Russel (2000) The integrated machine allocation and layout problem. International Journal of Production Research, 2913\u20132930.","DOI":"10.1080\/00207540050117369"},{"key":"8_CR98","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M.G.A. Verhoeven","year":"1995","unstructured":"M.G.A. Verhoeven and E.H.L. Aarts (1995) Parallel local search. Journal of Heuristics, 1, 43\u201365.","journal-title":"Journal of Heuristics"},{"key":"8_CR99","unstructured":"S. Voss, A. Martin and T. Koch (2001) Steinlib testdata library. Online document at http:\/\/elib.zib.de\/steinlib\/steinlib.html , last visited on May 1."},{"key":"8_CR100","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022565","volume":"41","author":"D.L. Woodruff","year":"1993","unstructured":"D.L. Woodruff and E. Zemel (1993) Hashing vectors for tabu search. Annals of Operations Research, 41, 123\u2013137.","journal-title":"Annals of Operations Research"},{"key":"8_CR101","doi-asserted-by":"crossref","first-page":"391","DOI":"10.2352\/J.ImagingSci.Technol.2000.44.5.art00003","volume":"44","author":"J. Yen","year":"2000","unstructured":"J. Yen, M. Carlsson, M. Chang, J.M. Garcia and H. Nguyen (2000) Constraint solving for inkjet print mask design. Journal of Imaging Science and Technology, 44, 391\u2013397.","journal-title":"Journal of Imaging Science and Technology"}],"container-title":["International Series in Operations Research &amp; Management Science","Handbook of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-306-48056-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T15:54:56Z","timestamp":1736265296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-306-48056-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402072635"],"references-count":101,"URL":"https:\/\/doi.org\/10.1007\/0-306-48056-5_8","relation":{},"subject":[]}}