{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:39:01Z","timestamp":1776436741316,"version":"3.51.2"},"publisher-location":"Boston","reference-count":78,"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_1","type":"book-chapter","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T18:26:26Z","timestamp":1138904786000},"page":"1-35","source":"Crossref","is-referenced-by-count":66,"title":["Scatter Search and Path Relinking: Advances and Applications"],"prefix":"10.1007","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Marti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Aiex, R.M., Resende, M.G.C., Pardalos, P.M. and Toraldo, G. (2000) GRASP with path relinking for the three-index assignment problem (submitted for publication)."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C. and Ribeiro, C.C. (2002) Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, 8, 343\u2013373.","journal-title":"Journal of Heuristics"},{"key":"1_CR3","unstructured":"Alvarez, A., Gonz\u00e1lez, J.L. and De Alba, K. (2001a) Un algoritmo de b\u00fasqueda para un problema de red capacitada multiproducto. In: C. Zozaya, M. Mej\u00eda, P. Noriega, A. S\u00e1nchez (eds.), Proceedings of 3rd International Meeting of Computational Sciences, Aguascalientes Mexico, pp. 105\u2013114."},{"key":"1_CR4","unstructured":"Alvarez, A., Gonz\u00e1lez, J.L. and De Alba, K. (2001 b) Scatter search for the multi-commodity capacitated network design problem. Proceedings of the 6th Annual International Conference on Industrial Engineering\u2014Theory, Applications and Practice. San Francisco, CA, USA."},{"key":"1_CR5","unstructured":"Beausoleil, R.P. (2001) Multiple criteria scatter search. 4th Metaheuritics International Congress, Porto, Portugal, pp. 539\u2013543."},{"key":"1_CR6","unstructured":"Bulut, G. (2001) Robust multi-scenario optimization of an air expeditionary force force structure applying scatter search to the combat forces assessment model. Masters Thesis, Department of Operational Sciences, Air Force Institute of Technology, AFIT\/GOR\/ENS\/01M-05."},{"key":"1_CR7","unstructured":"Campos, V., Laguna, M. and Mart\u00ed, R. (1999) Scatter search for the linear ordering problem. In: David Corne, Marco Dorigo and Fred Glover (eds.), New Ideas in Optimization, McGraw-Hill, pp. 331\u2013340."},{"key":"1_CR8","unstructured":"Canuto, S. A. (2000) Local Search for the Prize-collecting Steiner Tree Problem (in Portuguese), M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro."},{"key":"1_CR9","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. and Ribeiro, C.C. (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 38, 50\u201358.","journal-title":"Networks"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Cavique, L., Rego, C. and Themido, I. (2001) A Scatter Search Algorithm for the Maximum Clique Problem. Essays and Surveys in Metaheuristics, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1507-4_11"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00249646","volume":"6","author":"S. Chanas","year":"1996","unstructured":"Chanas, S. and Kobylanski, P. (1996) A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications, 6, 191\u2013205.","journal-title":"Computational Optimization and Applications"},{"key":"1_CR12","series-title":"Chapters II and III, ONR Research Memorandum","doi-asserted-by":"crossref","DOI":"10.21236\/AD0600965","volume-title":"Probabilistic learning combinations of local job shop scheduling rules","author":"W.B. Crowston","year":"1963","unstructured":"Crowston, W.B., Thompson, G.L. and Trawick, J.D. (1963) Probabilistic learning combinations of local job shop scheduling rules. Chapters II and III, ONR Research Memorandum No. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA."},{"key":"1_CR13","unstructured":"Cung, V.-D., Mautor, T., Michelon, P. and Tavares, A. (1997) A scatter search based approach for the quadratic assignment problem. In: T. B\u00e4ck, Z. Michalewicz and X. Yao (eds.), Proceedings of IEEE-ICEC-EPS\u201997, IEEE International Conference on Evolutionary Computation and Evolutionary Programming Conference. Indianapolis, pp. 165\u2013170."},{"key":"1_CR14","unstructured":"Cung, V.D., Martins, S.L., Ribeiro, C.C. and Roucairol, C. (2001) Strategies for the parallel implementation of metaheuristics. In: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer, pp. 263\u2013308."},{"key":"1_CR15","volume-title":"Minimizing Labor Requirements in a Periodic Vehicle Loading Problem","author":"C. Delgado","year":"2002","unstructured":"Delgado, C., Laguna, M. and Pacheco, J. (2002) Minimizing Labor Requirements in a Periodic Vehicle Loading Problem. University of Burgos, Spain."},{"key":"1_CR16","unstructured":"Dorne, R. and Hao, J.-K. (1998) Tabu search for graph coloring, T-colorings and set T-colorings. In: S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds.), Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, pp. 77\u201392."},{"key":"1_CR17","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"Eades, P. and Kelly, D. (1986) Heuristics for drawing 2-layered networks. Ars Combinatoria, 21, 89\u201398.","journal-title":"Ars Combinatoria"},{"key":"1_CR18","volume-title":"Essays and Surveys on Meta-Heuristics","author":"P. Festa","year":"2001","unstructured":"Festa, P. and Resendee, M.G.C. (2001) GRASP: an annotated bibliography. In: P. Hansen and C. Riberio (eds.), Essays and Surveys on Meta-Heuristics, Kluwer Academic Publishers, Boston, USA."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C. and Glover, F. (1999) Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"issue":"7","key":"1_CR20","first-page":"1420","volume":"E83-A","author":"N. Funabiki","year":"2000","unstructured":"Funabiki, N. and Higashino, T. (2000) A minimal-state processing search algorithm for graph colorings problems. IEICE Transactions on Fundamentals, E83-A(7), 1420\u20131430.","journal-title":"IEICE Transactions on Fundamentals"},{"issue":"4","key":"1_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P. and Hao, J.-K. (1999) Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4), 379\u2013397.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1_CR22","unstructured":"Garc\u00eda, F., Meli\u00e1n, B., Moreno, J.A. and Moreno, J.M. (2001) Hybrid metaheuristics based on the scatter search. Proceeding of EUNITE 2001. pp. 479\u2013485. ISBN: 3-89653-916-7. (European Symposium on Intelligent Technologies, Hybriis Systems and their implementation on Smart Adaptive Systems. December 13\u201314. Puerto de la Cruz, Tenerife, Spain.)"},{"key":"1_CR23","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M. and Johnson, D. (1979) Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York."},{"key":"1_CR24","unstructured":"Ghamlouche, I., Crainic, T.G. and Gendreau, M. (2002) Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Publication CRT-2002-01, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"1_CR25","unstructured":"Ghamlouche, I., Crainic, T.G. and Gendreau, M. (2001) Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Publication CRT-2001-01, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"1_CR26","series-title":"Chapter IV, ONR Research Memorandum","volume-title":"Parametric combinations of local job shop scheduling rules","author":"F. Glover","year":"1963","unstructured":"Glover, F. (1963) Parametric combinations of local job shop scheduling rules. Chapter IV, ONR Research Memorandum No. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA."},{"issue":"6","key":"1_CR27","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"Glover, F. (1965) A multiphase dual algorithm for the zero-one integer programming problem. Operations Research, 13(6), 879\u2013919.","journal-title":"Operations Research"},{"issue":"4","key":"1_CR28","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"Glover, F. (1968) Surrogate constraints. Operations Research, 16(4), 741\u2013749.","journal-title":"Operations Research"},{"issue":"1","key":"1_CR29","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977) Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156\u2013166.","journal-title":"Decision Sciences"},{"key":"1_CR30","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. (1994) Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Applied Mathematics, 49, 231\u2013255.","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01719256","volume":"17","author":"F. Glover","year":"1995","unstructured":"Glover, F. (1995) Scatter search and star paths: beyond the genetic metaphor. OR Spektrum, 17, 125\u2013137.","journal-title":"OR Spektrum"},{"key":"1_CR32","first-page":"1","volume-title":"Advances in Meta-heuristics, Optimization and Stochastic Modeling Techniques","author":"F. Glover","year":"1997","unstructured":"Glover, F. (1997) Tabu search and adaptive memory programming\u2014advances, applications and challenges. In. R. Barr, Helgason and Kennington (Co-eds.), Advances in Meta-heuristics, Optimization and Stochastic Modeling Techniques. Kluwer Academic Publishers, Boston, USA, pp. 1\u2013175."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Glover, F. (1998) A template for scatter search and path relinking. In: J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (eds.), Artificial Evolution, Lecture Notes in Computer Science 1363. Springer, pp. 3\u201351.","DOI":"10.1007\/BFb0026589"},{"key":"1_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and Laguna, M. (1997) Tabu Search. Kluwer Academic Publishers, Boston."},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Glover, F., L\u00f8kketangen, A. and Woodruff, D.L. (2000) Scatter search to generate diverse MIP solutions. In: M. Laguna and J.L. Gonz\u00e1lez-Velarde (eds.), OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 299\u2013317.","DOI":"10.1007\/978-1-4615-4567-5_17"},{"key":"1_CR36","volume-title":"A new very fast tabu search algorithm for the job shop problem","author":"J. Grabowski","year":"2001","unstructured":"Grabowski, J. and Wodecki, M. (2001) A new very fast tabu search algorithm for the job shop problem. Preprint 21\/2001, Instytut Cybernetyki Techncznej Politechniki Wroclawskiej, Wroclaw."},{"key":"1_CR37","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-3-642-79459-9_34","volume-title":"Operations Research Proceedings 1994","author":"P. Greistorfer","year":"1995","unstructured":"Greistorfer, P. (1995) Computational experiments with heuristics for a capacitated arc routing problem. In: U. Derigs, A. Bachem and A. Drexl (eds.), Operations Research Proceedings 1994. Springer-Verlag, Berlin, pp. 185\u2013190."},{"key":"1_CR38","unstructured":"Greistorfer, P. (2001a) A tabu scatter search metaheuristic for the arc routing problem. Computers & Industrial Engineering (forthcoming)."},{"key":"1_CR39","unstructured":"Greistorfer, P. (2001b) Testing population designs. 4th Metaheuristics International Conference (MIC\u20192001). Porto, pp. 713\u2013717 (17 pages submitted as \u201cExperimental pool design\u201d)."},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Hamiez, J.P. and Hao, J.K. (2001) Scatter search for graph coloring. To appear in the LNCS series (Springer).","DOI":"10.1007\/3-540-46033-0_14"},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/0377-2217(95)00305-3","volume":"95","author":"J.W. Herrmann","year":"1996","unstructured":"Herrmann J.W., Ioannou, G., Minis, I. and Proth, J.M. (1996) A dual ascent approach to the fixed-charge capacitated network design problem. European Journal of Operational Research, 95, 476\u2013490.","journal-title":"European Journal of Operational Research"},{"key":"1_CR42","unstructured":"Hill, R.R. and McIntyre, G. (2000) A methodology for robust, multi-scenario optimization. Phalanx, 33(3)."},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Johnson, D.S. and Trick, M.A. (eds.) (1996) Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, American Mathematical Society.","DOI":"10.1090\/dimacs\/026"},{"key":"1_CR44","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"D.E. Knuth","year":"1993","unstructured":"Knuth, D.E. (1993) The Stanford GraphBase: A Platform for Combinatorial Computing. Addison Wesley, New York."},{"key":"1_CR45","unstructured":"Laguna, M. (1999) Scatter search. In: P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. Oxford Academic Press (to appear)."},{"issue":"1","key":"1_CR46","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M. and Mart\u00ed, R. (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11(1), 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR47","volume-title":"Optimization Software Class Libraries","author":"M. Laguna","year":"2002","unstructured":"Laguna, M. and Mart\u00ed, R. (2002) The OptQuest callable library. In: S. Voss and D.L. Woodruff (eds.), Optimization Software Class Libraries, Kluwer, Boston."},{"key":"1_CR48","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R. and Campos, V. (1999) Intensification and diversification with Elite Tabu search solutions for the linear ordering problem. Computers and Operations Research, 26, 1217\u20131230","journal-title":"Computers and Operations Research"},{"issue":"3","key":"1_CR49","first-page":"741","volume":"29","author":"A. L\u00f8kketangen","year":"2000","unstructured":"L\u00f8kketangen, A. and Woodruff (2000) Integrating pivot based search with branch and bound for binary MIP\u2019s. Control and Cybernetics, Special Issue on Tabu Search, 29(3), 741\u2013760.","journal-title":"Control and Cybernetics, Special Issue on Tabu Search"},{"key":"1_CR50","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/S0377-2217(97)00295-6","volume":"106","author":"A. L\u00f8kketangen","year":"1998","unstructured":"L\u00f8kketangen, A. and Glover, F. (1998) Solving zero-one mixed integer programming problems using tabu search. European Journal of Operational Research, 106, 624\u2013658.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1_CR51","first-page":"89","volume":"1","author":"A. L\u00f8kketangen","year":"1995","unstructured":"L\u00f8kketangen, A. and Glover, F. (1995) Tabu search for zero\/one mixed integer programming with advanced level strategies and learning. International Journal of Operations and Quantitative Management, 1(2), 89\u2013109.","journal-title":"International Journal of Operations and Quantitative Management"},{"key":"1_CR52","unstructured":"L\u00f8kketangen, A. and Glover, F. (1996) Probabilistic move selection in Tabu search for 0\/1 mixed integer programming problems. In: Metaheuristics: Theory and Applications, by Kluwer, March 96. An earlier version is in the conference proceedings from MIC\u201995."},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"L\u00f8kketangen, A. and Glover, F. (1999) Candidate list and exploration strategies for solving 0\/1 MIP problems using a Pivot neighborhood. In: S. Vo\u00df, S. Martello, I.H. Osman and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, pp. 141\u2013155.","DOI":"10.1007\/978-1-4615-5775-3_10"},{"key":"1_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T. Magnanti","year":"1984","unstructured":"Magnanti, T. and Wong, R. (1984) Network design and transportation planning: models and algorithms. Transportation Science, 18, 1\u201355.","journal-title":"Transportation Science"},{"key":"1_CR55","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/S0377-2217(97)00291-9","volume":"106","author":"R. Mart\u00ed","year":"1998","unstructured":"Mart\u00ed, R. (1998) A Tabu search algorithm for the Bipartite drawing problem. European Journal of Operational Research, 106, 558\u2013569.","journal-title":"European Journal of Operational Research"},{"key":"1_CR56","unstructured":"Mart\u00ed, R. and Laguna, M. (1997) Heuristics and metaheuristics for 2-layer straight line crossing minimization. Discrete and Applied Mathematics (to appear)."},{"key":"1_CR57","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Louren\u00e7o, L. and Laguna, M. (2000) Assigning proctors to exams with scatter search. In: M. Laguna and J.L. Gonz\u00e1lez Velarde (eds.), Computing Tools for Modeling, Optimization and Simulation, Kluwer Academic Publishers, pp.215\u2013228.","DOI":"10.1007\/978-1-4615-4567-5_12"},{"key":"1_CR58","unstructured":"Mart\u00ed, R., Louren\u00e7o, L. and Laguna, M. (2001) Assigning proctors to exams with scatter search (second part), Economic Working Papers Series, Department of Economics and Business, Universitat Pompeu Fabra, no. 534."},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"Morgenstern, C. A. (1996) Distributed coloration neighborhood search. In Johnson and Trick (1996), pp. 335\u2013357.","DOI":"10.1090\/dimacs\/026\/16"},{"issue":"6","key":"1_CR60","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E. and Smutnicki, C. (1996) A fast tabu search algorithm for the job-shop problem. Management Science, 42(6), 797\u2013813.","journal-title":"Management Science"},{"key":"1_CR61","unstructured":"Nowicki, E., and Smutnicki, C. (2001a) New ideas in TS for job-shop scheduling. Technical Report 50\/2001. In: C. Rego and B. Alidaee (eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search. Kluwer Academic Publishers."},{"key":"1_CR62","unstructured":"Nowicki, E. and Smutnicki, C. (2001b) New tools to solve the job-shop problem. Technical Report 51."},{"key":"1_CR63","first-page":"117","volume-title":"Proceedings of the Workshop on \u201calgorithm engineering as a new paradigm: a challenge to hard computation problems\u201d","author":"I.H. Osman","year":"2000","unstructured":"Osman, I.H. (2000) Meta-heuristics: A general framework. In: Proceedings of the Workshop on \u201calgorithm engineering as a new paradigm: a challenge to hard computation problems\u201d October 30\u2013November 2, Research Institute for Mathematical Science, Kyoto University, Japan, pp. 117\u2013118."},{"key":"1_CR64","unstructured":"Osman, I.H. and Samad Ahmadi (2001) Guided Construction search Meta-Heuristics for the Capacitated Clustering Problem. Working Paper, School of Business, American University of Beirut."},{"key":"1_CR65","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"I","author":"I.H. Osman","year":"1994","unstructured":"Osman, I.H. (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research, I, 317\u2013336.","journal-title":"International Transactions in Operational Research"},{"key":"1_CR66","unstructured":"Rego, Cesar and Pedro Le\u00e3o (2000) A Scatter Search Tutorial for Graph-Based Permutation Problems. Hearin Center for Enterprise Science, U of Mississippi, Report Number: HCES-10-00."},{"key":"1_CR67","unstructured":"Reinelt, G. (1985) The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, Vol. 8, H.H. Hofmann and R. Wille (eds.), Heldermann Verlag Berlin."},{"key":"1_CR68","unstructured":"Resende, M.G.C. and Ribeiro, C.C. (2001) A GRASP with path relinking for permanent virtual circuit routing. Research Report (submitted for publication)."},{"key":"1_CR69","unstructured":"Resende, M.G.C. and C.C. Ribeiro (2002) \u201cGRASP\u201d, In: F. Glover and G. Kochenberger (eds.), State-of-the-Art Handbook of Metaheuristics. Kluwer (to appear)."},{"key":"1_CR70","doi-asserted-by":"crossref","unstructured":"Ribeiro, C.C, \u223cUchoa, E. and Werneck, R.F. (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing (to appear)","DOI":"10.1287\/ijoc.14.3.228.116"},{"key":"1_CR71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230090102","volume":"9","author":"R.A. Rusell","year":"1979","unstructured":"Rusell, R.A. and Igo, W. (1979) An assignment routing problem. Networks, 9, 1\u201317.","journal-title":"Networks"},{"key":"1_CR72","unstructured":"Souza, M.C., Duhamel, C. and Ribeiro, C.C. (2002) A GRASP heuristic using a path-based local search for the capacitated minimum spanning tree problem. Research Report (submitted for publication)."},{"key":"1_CR73","unstructured":"Valls, V., Quintanilla, S. and Ballest\u00edn, F. (2001) A Population Based Approach to the Resource ConstrainedProject Scheduling. TR06-2001, Departamento de Estad\u00edstica e Investigaci\u00f3n Operativa, Facultad de Matem\u00e1ticas, Universitat de Valencia (Spain)."},{"key":"1_CR74","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M.G.A. Verhoeven","year":"1995","unstructured":"Verhoeven, M.G.A. and Aarts, E.H.L. (1995) Parallel local search. Journal of Heuristics, 1, 43\u201365.","journal-title":"Journal of Heuristics"},{"key":"1_CR75","unstructured":"Voss, S., Martin, A. and Koch, T. (2001) SteinLib testdata library. online document at http:\/\/elib.zib.de\/steinlib\/steinlib.html ."},{"key":"1_CR76","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"D.L. Woodruff","year":"1998","unstructured":"Woodruff, D.L. (1998) Proposals for chunking and Tabu search. European Journal of Operation Research, 106, 585\u2013598.","journal-title":"European Journal of Operation Research"},{"key":"1_CR77","unstructured":"Woodruff, D.L. (2001) General purpose metrics for solution variety. Technical Report, Graduate School of Management, UC Davis, Davis CA 95616."},{"key":"1_CR78","doi-asserted-by":"crossref","unstructured":"Woodruff, D.L. (1996) Chunking applied to reactive Tabu search. In: I.H. Osman and J.P. Kelly (eds.), Metaheuristics: Theory and Applications. pp. 555\u2013570.","DOI":"10.1007\/978-1-4613-1361-8_33"}],"container-title":["International Series in Operations Research & Management Science","Handbook of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-306-48056-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T04:20:14Z","timestamp":1619497214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-306-48056-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402072635"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/0-306-48056-5_1","relation":{},"subject":[]}}